Base | Representation |
---|---|
bin | 1110100011010110111000… |
… | …01010100110111000010101 |
3 | 11012022021200122210012021111 |
4 | 13101223130022212320111 |
5 | 13143301424212422123 |
6 | 152021052015015021 |
7 | 6512003366645323 |
oct | 721533412467025 |
9 | 135267618705244 |
10 | 32001200123413 |
11 | a2186a6222374 |
12 | 370a06920a471 |
13 | 14b191450c001 |
14 | 7c8c1b39cd13 |
15 | 3a765831890d |
hex | 1d1adc2a6e15 |
32001200123413 has 2 divisors, whose sum is σ = 32001200123414. Its totient is φ = 32001200123412.
The previous prime is 32001200123201. The next prime is 32001200123447. The reversal of 32001200123413 is 31432100210023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21181883254884 + 10819316868529 = 4602378^2 + 3289273^2 .
It is a cyclic number.
It is not a de Polignac number, because 32001200123413 - 217 = 32001199992341 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32001200123483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16000600061706 + 16000600061707.
It is an arithmetic number, because the mean of its divisors is an integer number (16000600061707).
Almost surely, 232001200123413 is an apocalyptic number.
It is an amenable number.
32001200123413 is a deficient number, since it is larger than the sum of its proper divisors (1).
32001200123413 is an equidigital number, since it uses as much as digits as its factorization.
32001200123413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 32001200123413 its reverse (31432100210023), we get a palindrome (63433300333436).
The spelling of 32001200123413 in words is "thirty-two trillion, one billion, two hundred million, one hundred twenty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.697 sec. • engine limits •