Base | Representation |
---|---|
bin | 10110110000110010101110… |
… | …010011101001011011111011 |
3 | 111010110102110120100101020220 |
4 | 112300302232103221123323 |
5 | 101110200311130334321 |
6 | 552525524222351123 |
7 | 30041465446555104 |
oct | 2660625623513373 |
9 | 433412416311226 |
10 | 100110022121211 |
11 | 29997470696283 |
12 | b289baba2b4a3 |
13 | 43b24470b990b |
14 | 1aa14cad133ab |
15 | b891587d69c6 |
hex | 5b0cae4e96fb |
100110022121211 has 8 divisors (see below), whose sum is σ = 133480732866384. Its totient is φ = 66739663061760.
The previous prime is 100110022121209. The next prime is 100110022121293. The reversal of 100110022121211 is 112121220011001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100110022121211 - 21 = 100110022121209 is a prime.
It is a super-2 number, since 2×1001100221212112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100110022121111) 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, 87256510 + ... + 88396371.
It is an arithmetic number, because the mean of its divisors is an integer number (16685091608298).
Almost surely, 2100110022121211 is an apocalyptic number.
100110022121211 is a deficient number, since it is larger than the sum of its proper divisors (33370710745173).
100110022121211 is a wasteful number, since it uses less digits than its factorization.
100110022121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175842861.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 100110022121211 its reverse (112121220011001), we get a palindrome (212231242132212).
The spelling of 100110022121211 in words is "one hundred trillion, one hundred ten billion, twenty-two million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •