Base | Representation |
---|---|
bin | 1011000110101110111111… |
… | …0011100011000110111001 |
3 | 1121020021222012212111222002 |
4 | 2301223233303203012321 |
5 | 3100023214000314001 |
6 | 41545202124310345 |
7 | 2400111056163533 |
oct | 261535763430671 |
9 | 47207865774862 |
10 | 12210320323001 |
11 | 3988405555469 |
12 | 14525376a23b5 |
13 | 6a7574b91458 |
14 | 302da85a6853 |
15 | 16294242846b |
hex | b1aefce31b9 |
12210320323001 has 2 divisors, whose sum is σ = 12210320323002. Its totient is φ = 12210320323000.
The previous prime is 12210320322997. The next prime is 12210320323021. The reversal of 12210320323001 is 10032302301221.
It is an a-pointer prime, because the next prime (12210320323021) can be obtained adding 12210320323001 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9383469930025 + 2826850392976 = 3063245^2 + 1681324^2 .
It is a cyclic number.
It is not a de Polignac number, because 12210320323001 - 22 = 12210320322997 is a prime.
It is not a weakly prime, because it can be changed into another prime (12210320323021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105160161500 + 6105160161501.
It is an arithmetic number, because the mean of its divisors is an integer number (6105160161501).
Almost surely, 212210320323001 is an apocalyptic number.
It is an amenable number.
12210320323001 is a deficient number, since it is larger than the sum of its proper divisors (1).
12210320323001 is an equidigital number, since it uses as much as digits as its factorization.
12210320323001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 12210320323001 its reverse (10032302301221), we get a palindrome (22242622624222).
The spelling of 12210320323001 in words is "twelve trillion, two hundred ten billion, three hundred twenty million, three hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •