Base | Representation |
---|---|
bin | 10010110110011001… |
… | …10001100111101101 |
3 | 222010021120210012101 |
4 | 21123030301213231 |
5 | 131211210311341 |
6 | 4352110535101 |
7 | 505532444656 |
oct | 113314614755 |
9 | 28107523171 |
10 | 10120010221 |
11 | 4323533512 |
12 | 1b65207491 |
13 | c53818c39 |
14 | 6c008252d |
15 | 3e36b6831 |
hex | 25b3319ed |
10120010221 has 16 divisors (see below), whose sum is σ = 10405370880. Its totient is φ = 9839491200.
The previous prime is 10120010207. The next prime is 10120010273. The reversal of 10120010221 is 12201002101.
10120010221 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10120010221 - 27 = 10120010093 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10120010198 and 10120010207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120013221) 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, 1759276 + ... + 1765018.
It is an arithmetic number, because the mean of its divisors is an integer number (650335680).
Almost surely, 210120010221 is an apocalyptic number.
It is an amenable number.
10120010221 is a deficient number, since it is larger than the sum of its proper divisors (285360659).
10120010221 is a wasteful number, since it uses less digits than its factorization.
10120010221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6156.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10120010221 its reverse (12201002101), we get a palindrome (22321012322).
The spelling of 10120010221 in words is "ten billion, one hundred twenty million, ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •