Base | Representation |
---|---|
bin | 1001000111111101000000… |
… | …1010011011110100100111 |
3 | 1022112001222010102101211201 |
4 | 2101333100022123310213 |
5 | 2303332012201014422 |
6 | 33200425314143331 |
7 | 2053543166530462 |
oct | 221772012336447 |
9 | 38461863371751 |
10 | 10032241032487 |
11 | 3218716582a13 |
12 | 1160395281b47 |
13 | 57a0618ba73b |
14 | 2697c50562d9 |
15 | 125e65691727 |
hex | 91fd029bd27 |
10032241032487 has 2 divisors, whose sum is σ = 10032241032488. Its totient is φ = 10032241032486.
The previous prime is 10032241032409. The next prime is 10032241032523. The reversal of 10032241032487 is 78423014223001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10032241032487 - 211 = 10032241030439 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10032241032587) 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, 5016120516243 + 5016120516244.
It is an arithmetic number, because the mean of its divisors is an integer number (5016120516244).
Almost surely, 210032241032487 is an apocalyptic number.
10032241032487 is a deficient number, since it is larger than the sum of its proper divisors (1).
10032241032487 is an equidigital number, since it uses as much as digits as its factorization.
10032241032487 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64512, while the sum is 37.
Adding to 10032241032487 its reverse (78423014223001), we get a palindrome (88455255255488).
The spelling of 10032241032487 in words is "ten trillion, thirty-two billion, two hundred forty-one million, thirty-two thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •