Base | Representation |
---|---|
bin | 10010110100010000… |
… | …11111100001011101 |
3 | 222002000220101010101 |
4 | 21122020133201131 |
5 | 131142120012201 |
6 | 4350231141101 |
7 | 505224343423 |
oct | 113210374135 |
9 | 28060811111 |
10 | 10102110301 |
11 | 4314417a98 |
12 | 1b5b214791 |
13 | c4cbbc67a |
14 | 6bb943113 |
15 | 3e1d2cd01 |
hex | 25a21f85d |
10102110301 has 8 divisors (see below), whose sum is σ = 10565800704. Its totient is φ = 9640458960.
The previous prime is 10102110283. The next prime is 10102110307. The reversal of 10102110301 is 10301120101.
10102110301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10102110301 - 215 = 10102077533 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10102110307) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 499626 + ... + 519451.
It is an arithmetic number, because the mean of its divisors is an integer number (1320725088).
Almost surely, 210102110301 is an apocalyptic number.
It is an amenable number.
10102110301 is a deficient number, since it is larger than the sum of its proper divisors (463690403).
10102110301 is a wasteful number, since it uses less digits than its factorization.
10102110301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1019531.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 10102110301 its reverse (10301120101), we get a palindrome (20403230402).
The spelling of 10102110301 in words is "ten billion, one hundred two million, one hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •