Base | Representation |
---|---|
bin | 10010110110011001… |
… | …10100011111100101 |
3 | 222010021121101100020 |
4 | 21123030310133211 |
5 | 131211211200424 |
6 | 4352111105353 |
7 | 505532524200 |
oct | 113314643745 |
9 | 28107541306 |
10 | 10120021989 |
11 | 4323541340 |
12 | 1b65212259 |
13 | c538213bc |
14 | 6c0086937 |
15 | 3e36ba079 |
hex | 25b3347e5 |
10120021989 has 24 divisors (see below), whose sum is σ = 17123305248. Its totient is φ = 5257153440.
The previous prime is 10120021981. The next prime is 10120022009. The reversal of 10120021989 is 98912002101.
It is not a de Polignac number, because 10120021989 - 23 = 10120021981 is a prime.
It is a super-2 number, since 2×101200219892 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120021981) 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 23 ways as a sum of consecutive naturals, for example, 3127642 + ... + 3130875.
It is an arithmetic number, because the mean of its divisors is an integer number (713471052).
Almost surely, 210120021989 is an apocalyptic number.
It is an amenable number.
10120021989 is a deficient number, since it is larger than the sum of its proper divisors (7003283259).
10120021989 is a wasteful number, since it uses less digits than its factorization.
10120021989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6258545 (or 6258538 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 33.
The spelling of 10120021989 in words is "ten billion, one hundred twenty million, twenty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •