Base | Representation |
---|---|
bin | 10110101111010110100001… |
… | …011100111111101011101011 |
3 | 111010002221221002120022122111 |
4 | 112233112201130333223223 |
5 | 101102040033142020021 |
6 | 552412232423103151 |
7 | 30031362235361410 |
oct | 2657264134775353 |
9 | 433087832508574 |
10 | 100011022220011 |
11 | 29959488841211 |
12 | b272980ba1ab7 |
13 | 43a5cca850316 |
14 | 1a9a7b8a28107 |
15 | b867b229c8e1 |
hex | 5af5a173faeb |
100011022220011 has 8 divisors (see below), whose sum is σ = 114999527742464. Its totient is φ = 85197820856040.
The previous prime is 100011022219991. The next prime is 100011022220029. The reversal of 100011022220011 is 110022220110001.
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 100011022220011 - 223 = 100011013831403 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100011022219973 and 100011022220000.
It is not an unprimeable number, because it can be changed into a prime (100011022220051) 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, 43826038395 + ... + 43826040676.
It is an arithmetic number, because the mean of its divisors is an integer number (14374940967808).
Almost surely, 2100011022220011 is an apocalyptic number.
100011022220011 is a deficient number, since it is larger than the sum of its proper divisors (14988505522453).
100011022220011 is an equidigital number, since it uses as much as digits as its factorization.
100011022220011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87652079241.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100011022220011 its reverse (110022220110001), we get a palindrome (210033242330012).
The spelling of 100011022220011 in words is "one hundred trillion, eleven billion, twenty-two million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •