Base | Representation |
---|---|
bin | 1001000111111000011001… |
… | …0000001101100011111101 |
3 | 1022111221202201010220021012 |
4 | 2101332012100031203331 |
5 | 2303321442231023312 |
6 | 33200102300445005 |
7 | 2053500361645502 |
oct | 221760620154375 |
9 | 38457681126235 |
10 | 10031001032957 |
11 | 321813a636a13 |
12 | 11600a9b49765 |
13 | 579bc4a2c9c8 |
14 | 2697084b34a9 |
15 | 125de18a4322 |
hex | 91f8640d8fd |
10031001032957 has 2 divisors, whose sum is σ = 10031001032958. Its totient is φ = 10031001032956.
The previous prime is 10031001032903. The next prime is 10031001032977. The reversal of 10031001032957 is 75923010013001.
10031001032957 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10020934723396 + 10066309561 = 3165586^2 + 100331^2 .
It is a cyclic number.
It is not a de Polignac number, because 10031001032957 - 214 = 10031001016573 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10031001032977) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5015500516478 + 5015500516479.
It is an arithmetic number, because the mean of its divisors is an integer number (5015500516479).
Almost surely, 210031001032957 is an apocalyptic number.
It is an amenable number.
10031001032957 is a deficient number, since it is larger than the sum of its proper divisors (1).
10031001032957 is an equidigital number, since it uses as much as digits as its factorization.
10031001032957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5670, while the sum is 32.
Adding to 10031001032957 its reverse (75923010013001), we get a palindrome (85954011045958).
The spelling of 10031001032957 in words is "ten trillion, thirty-one billion, one million, thirty-two thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •