Base | Representation |
---|---|
bin | 1001101001010100110001… |
… | …10010111100101001111011 |
3 | 2210002202120212100201011022 |
4 | 10310222120302330221323 |
5 | 10240010324133000443 |
6 | 113040130023253055 |
7 | 4316311062122513 |
oct | 464523062745173 |
9 | 83082525321138 |
10 | 21211112000123 |
11 | 683864482a301 |
12 | 2466a325aa18b |
13 | bab278a7b936 |
14 | 5348a248c843 |
15 | 26bb3a385e68 |
hex | 134a98cbca7b |
21211112000123 has 8 divisors (see below), whose sum is σ = 21558953690736. Its totient is φ = 20863274133600.
The previous prime is 21211112000077. The next prime is 21211112000153. The reversal of 21211112000123 is 32100021111212.
It is a happy number.
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 21211112000123 - 28 = 21211111999867 is a prime.
It is a super-2 number, since 2×212111120001232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21211112000153) 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, 11561165 + ... + 13269617.
It is an arithmetic number, because the mean of its divisors is an integer number (2694869211342).
Almost surely, 221211112000123 is an apocalyptic number.
21211112000123 is a deficient number, since it is larger than the sum of its proper divisors (347841690613).
21211112000123 is a wasteful number, since it uses less digits than its factorization.
21211112000123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1912045.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 21211112000123 its reverse (32100021111212), we get a palindrome (53311133111335).
The spelling of 21211112000123 in words is "twenty-one trillion, two hundred eleven billion, one hundred twelve million, one hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.224 sec. • engine limits •