Base | Representation |
---|---|
bin | 1001011000110100110111… |
… | …0100100010110111001001 |
3 | 1100112210011201211220100002 |
4 | 2112031031310202313021 |
5 | 2323104141140012301 |
6 | 33541525055452345 |
7 | 2113514362423064 |
oct | 226151564426711 |
9 | 40483151756302 |
10 | 10322112032201 |
11 | 331a6461663a2 |
12 | 11a85b25270b5 |
13 | 59b4a90a3448 |
14 | 279842c558db |
15 | 12d77d9b016b |
hex | 9634dd22dc9 |
10322112032201 has 2 divisors, whose sum is σ = 10322112032202. Its totient is φ = 10322112032200.
The previous prime is 10322112032191. The next prime is 10322112032279. The reversal of 10322112032201 is 10223021122301.
10322112032201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9972641886601 + 349470145600 = 3157949^2 + 591160^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10322112032201 is a prime.
It is not a weakly prime, because it can be changed into another prime (10322112037201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5161056016100 + 5161056016101.
It is an arithmetic number, because the mean of its divisors is an integer number (5161056016101).
Almost surely, 210322112032201 is an apocalyptic number.
It is an amenable number.
10322112032201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10322112032201 is an equidigital number, since it uses as much as digits as its factorization.
10322112032201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 10322112032201 its reverse (10223021122301), we get a palindrome (20545133154502).
The spelling of 10322112032201 in words is "ten trillion, three hundred twenty-two billion, one hundred twelve million, thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •