Base | Representation |
---|---|
bin | 10010110101001110… |
… | …10110110010111101 |
3 | 222002121010102111200 |
4 | 21122213112302331 |
5 | 131201202413041 |
6 | 4351120410113 |
7 | 505353201504 |
oct | 113247266275 |
9 | 28077112450 |
10 | 10110201021 |
11 | 4318a43738 |
12 | 1b61a76939 |
13 | c5179318b |
14 | 6bca4b83b |
15 | 3e28ca1b6 |
hex | 25a9d6cbd |
10110201021 has 12 divisors (see below), whose sum is σ = 14604963360. Its totient is φ = 6739515720.
The previous prime is 10110201007. The next prime is 10110201047. The reversal of 10110201021 is 12010201101.
It is a happy number.
10110201021 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10110201021 - 210 = 10110199997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10110200994 and 10110201012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110201221) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 66190 + ... + 156848.
It is an arithmetic number, because the mean of its divisors is an integer number (1217080280).
Almost surely, 210110201021 is an apocalyptic number.
It is an amenable number.
10110201021 is a deficient number, since it is larger than the sum of its proper divisors (4494762339).
10110201021 is a wasteful number, since it uses less digits than its factorization.
10110201021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103056 (or 103053 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10110201021 its reverse (12010201101), we get a palindrome (22120402122).
The spelling of 10110201021 in words is "ten billion, one hundred ten million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •