Base | Representation |
---|---|
bin | 1001001100011110101110… |
… | …0011111001000100000101 |
3 | 1022210111200222122110120101 |
4 | 2103013223203321010011 |
5 | 2311120300041231041 |
6 | 33300250255204101 |
7 | 2062265321650564 |
oct | 223075343710405 |
9 | 38714628573511 |
10 | 10110010102021 |
11 | 32486a4153a05 |
12 | 1173479b16631 |
13 | 5844a678154b |
14 | 26d4817c1bdb |
15 | 127eb7d83b31 |
hex | 931eb8f9105 |
10110010102021 has 8 divisors (see below), whose sum is σ = 10216035162144. Its totient is φ = 10004101237200.
The previous prime is 10110010102019. The next prime is 10110010102063. The reversal of 10110010102021 is 12020101001101.
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 10110010102021 - 21 = 10110010102019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10110010101989 and 10110010102007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110010102091) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28873891 + ... + 29221936.
It is an arithmetic number, because the mean of its divisors is an integer number (1277004395268).
Almost surely, 210110010102021 is an apocalyptic number.
It is an amenable number.
10110010102021 is a deficient number, since it is larger than the sum of its proper divisors (106025060123).
10110010102021 is a wasteful number, since it uses less digits than its factorization.
10110010102021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58097651.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10110010102021 its reverse (12020101001101), we get a palindrome (22130111103122).
The spelling of 10110010102021 in words is "ten trillion, one hundred ten billion, ten million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •