Base | Representation |
---|---|
bin | 10010110100000000… |
… | …11111111110100100 |
3 | 222001212221220221002 |
4 | 21122000133332210 |
5 | 131141100440022 |
6 | 4350114212432 |
7 | 505200465623 |
oct | 113200377644 |
9 | 28055856832 |
10 | 10100015012 |
11 | 431321684a |
12 | 1b5a584118 |
13 | c4c637a59 |
14 | 6bb5596ba |
15 | 3e1a67092 |
hex | 25a01ffa4 |
10100015012 has 12 divisors (see below), whose sum is σ = 17766608076. Its totient is φ = 5023841280.
The previous prime is 10100014999. The next prime is 10100015021. The reversal of 10100015012 is 21051000101.
10100015012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 1342049956 + 8757965056 = 36634^2 + 93584^2 .
It is a junction number, because it is equal to n+sod(n) for n = 10100014984 and 10100015002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6540689 + ... + 6542232.
It is an arithmetic number, because the mean of its divisors is an integer number (1480550673).
Almost surely, 210100015012 is an apocalyptic number.
It is an amenable number.
10100015012 is a deficient number, since it is larger than the sum of its proper divisors (7666593064).
10100015012 is a wasteful number, since it uses less digits than its factorization.
10100015012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13083118 (or 13083116 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 11.
Adding to 10100015012 its reverse (21051000101), we get a palindrome (31151015113).
The spelling of 10100015012 in words is "ten billion, one hundred million, fifteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •