Base | Representation |
---|---|
bin | 1001100010011011110101… |
… | …0100011110000111001101 |
3 | 1101010120021101212011121220 |
4 | 2120212331110132013031 |
5 | 2333310232001221311 |
6 | 34145425500113553 |
7 | 2131450244230026 |
oct | 230467524360715 |
9 | 41116241764556 |
10 | 10487191429581 |
11 | 3383658185a29 |
12 | 12145a32358b9 |
13 | 5b0c2677a939 |
14 | 2838231b7c4d |
15 | 132be1339206 |
hex | 989bd51e1cd |
10487191429581 has 32 divisors (see below), whose sum is σ = 14214494891520. Its totient is φ = 6876797681664.
The previous prime is 10487191429573. The next prime is 10487191429601. The reversal of 10487191429581 is 18592419178401.
It is a happy number.
It is not a de Polignac number, because 10487191429581 - 23 = 10487191429573 is a prime.
It is a super-2 number, since 2×104871914295812 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10487191479581) 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 in 31 ways as a sum of consecutive naturals, for example, 24410476 + ... + 24836378.
It is an arithmetic number, because the mean of its divisors is an integer number (444202965360).
Almost surely, 210487191429581 is an apocalyptic number.
It is an amenable number.
10487191429581 is a deficient number, since it is larger than the sum of its proper divisors (3727303461939).
10487191429581 is a wasteful number, since it uses less digits than its factorization.
10487191429581 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 426565.
The product of its (nonzero) digits is 5806080, while the sum is 60.
The spelling of 10487191429581 in words is "ten trillion, four hundred eighty-seven billion, one hundred ninety-one million, four hundred twenty-nine thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •