Base | Representation |
---|---|
bin | 10010101010011111… |
… | …01001110010110101 |
3 | 221212022120212221000 |
4 | 21111033221302311 |
5 | 131010121220201 |
6 | 4334141313513 |
7 | 503210312220 |
oct | 112517516265 |
9 | 27768525830 |
10 | 10020101301 |
11 | 42820a4461 |
12 | 1b37865899 |
13 | c38c07a32 |
14 | 6b0ab65b7 |
15 | 3d9a2dd86 |
hex | 2553e9cb5 |
10020101301 has 32 divisors (see below), whose sum is σ = 16970342400. Its totient is φ = 5724054000.
The previous prime is 10020101281. The next prime is 10020101321. The reversal of 10020101301 is 10310102001.
It is an interprime number because it is at equal distance from previous prime (10020101281) and next prime (10020101321).
It is not a de Polignac number, because 10020101301 - 27 = 10020101173 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10020101321) 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 31 ways as a sum of consecutive naturals, for example, 892360 + ... + 903518.
It is an arithmetic number, because the mean of its divisors is an integer number (530323200).
Almost surely, 210020101301 is an apocalyptic number.
It is an amenable number.
10020101301 is a deficient number, since it is larger than the sum of its proper divisors (6950241099).
10020101301 is a wasteful number, since it uses less digits than its factorization.
10020101301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15926 (or 15920 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 10020101301 its reverse (10310102001), we get a palindrome (20330203302).
The spelling of 10020101301 in words is "ten billion, twenty million, one hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •