Base | Representation |
---|---|
bin | 1001010011100101010010… |
… | …0101110101000101001111 |
3 | 1100020011122212001200011002 |
4 | 2110321110211311011033 |
5 | 2320120200003130332 |
6 | 33432310313050515 |
7 | 2104145163022316 |
oct | 224712445650517 |
9 | 40204585050132 |
10 | 10232031301967 |
11 | 329541aa15502 |
12 | 11930526b6a3b |
13 | 592b516265c7 |
14 | 27533934127d |
15 | 12b25a4d8562 |
hex | 94e5497514f |
10232031301967 has 2 divisors, whose sum is σ = 10232031301968. Its totient is φ = 10232031301966.
The previous prime is 10232031301957. The next prime is 10232031302093. The reversal of 10232031301967 is 76910313023201.
10232031301967 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 is a cyclic number.
It is not a de Polignac number, because 10232031301967 - 214 = 10232031285583 is a prime.
It is a super-2 number, since 2×102320313019672 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10232031301967.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10232031301937) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5116015650983 + 5116015650984.
It is an arithmetic number, because the mean of its divisors is an integer number (5116015650984).
Almost surely, 210232031301967 is an apocalyptic number.
10232031301967 is a deficient number, since it is larger than the sum of its proper divisors (1).
10232031301967 is an equidigital number, since it uses as much as digits as its factorization.
10232031301967 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 40824, while the sum is 38.
The spelling of 10232031301967 in words is "ten trillion, two hundred thirty-two billion, thirty-one million, three hundred one thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •