Base | Representation |
---|---|
bin | 1001101011111110011101… |
… | …10001110111100101111011 |
3 | 2210102110201210002012121101 |
4 | 10311333032301313211323 |
5 | 10243003412233000443 |
6 | 113150033500352231 |
7 | 4326014446262245 |
oct | 465771661674573 |
9 | 83373653065541 |
10 | 21302212000123 |
11 | 68732433656aa |
12 | 2480617845677 |
13 | bb6a36751892 |
14 | 5390654c9095 |
15 | 26e1bd09884d |
hex | 135fcec7797b |
21302212000123 has 4 divisors (see below), whose sum is σ = 22036771034640. Its totient is φ = 20567652965608.
The previous prime is 21302212000093. The next prime is 21302212000247. The reversal of 21302212000123 is 32100021220312.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21302212000123 - 29 = 21302211999611 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21302212000123.
It is not an unprimeable number, because it can be changed into a prime (21302212004123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 367279517215 + ... + 367279517272.
It is an arithmetic number, because the mean of its divisors is an integer number (5509192758660).
Almost surely, 221302212000123 is an apocalyptic number.
21302212000123 is a deficient number, since it is larger than the sum of its proper divisors (734559034517).
21302212000123 is an equidigital number, since it uses as much as digits as its factorization.
21302212000123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 734559034516.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 21302212000123 its reverse (32100021220312), we get a palindrome (53402233220435).
The spelling of 21302212000123 in words is "twenty-one trillion, three hundred two billion, two 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.070 sec. • engine limits •