Base | Representation |
---|---|
bin | 10010101010100110… |
… | …11110000110111101 |
3 | 221212101110201122102 |
4 | 21111103132012331 |
5 | 131010400231023 |
6 | 4334214554445 |
7 | 503221650566 |
oct | 112523360675 |
9 | 27771421572 |
10 | 10021102013 |
11 | 428271829a |
12 | 1b38068a25 |
13 | c39198380 |
14 | 6b0c9716d |
15 | 3d9b7a628 |
hex | 2554de1bd |
10021102013 has 16 divisors (see below), whose sum is σ = 11533596480. Its totient is φ = 8624729856.
The previous prime is 10021101997. The next prime is 10021102019. The reversal of 10021102013 is 31020112001.
It is a cyclic number.
It is not a de Polignac number, because 10021102013 - 24 = 10021101997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10021101985 and 10021102003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021102019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 188243 + ... + 235536.
It is an arithmetic number, because the mean of its divisors is an integer number (720849780).
Almost surely, 210021102013 is an apocalyptic number.
10021102013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10021102013 is a deficient number, since it is larger than the sum of its proper divisors (1512494467).
10021102013 is a wasteful number, since it uses less digits than its factorization.
10021102013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423916.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10021102013 its reverse (31020112001), we get a palindrome (41041214014).
The spelling of 10021102013 in words is "ten billion, twenty-one million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •