Base | Representation |
---|---|
bin | 10110110000110010110011… |
… | …000001000000100010111011 |
3 | 111010110102200001222222212211 |
4 | 112300302303001000202323 |
5 | 101110200441341334321 |
6 | 552525540123515551 |
7 | 30041500426214566 |
oct | 2660626301004273 |
9 | 433412601888784 |
10 | 100110101121211 |
11 | 29997501244135 |
12 | b28a012388bb7 |
13 | 43b245a589a8c |
14 | 1aa14d75d94dd |
15 | b891606de0e1 |
hex | 5b0cb30408bb |
100110101121211 has 8 divisors (see below), whose sum is σ = 100474416192384. Its totient is φ = 99746183994240.
The previous prime is 100110101121209. The next prime is 100110101121293. The reversal of 100110101121211 is 112121101011001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100110101121211 - 21 = 100110101121209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100110101121191 and 100110101121200.
It is not an unprimeable number, because it can be changed into a prime (100110101191211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 98981995 + ... + 99988276.
It is an arithmetic number, because the mean of its divisors is an integer number (12559302024048).
Almost surely, 2100110101121211 is an apocalyptic number.
100110101121211 is a deficient number, since it is larger than the sum of its proper divisors (364315071173).
100110101121211 is a wasteful number, since it uses less digits than its factorization.
100110101121211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 198972101.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 100110101121211 its reverse (112121101011001), we get a palindrome (212231202132212).
The spelling of 100110101121211 in words is "one hundred trillion, one hundred ten billion, one hundred one million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •