Base | Representation |
---|---|
bin | 10011000000000100… |
… | …01011110101110000 |
3 | 222022221012121001102 |
4 | 21200002023311300 |
5 | 131342441320422 |
6 | 4404125223532 |
7 | 510536042651 |
oct | 114002136560 |
9 | 28287177042 |
10 | 10201120112 |
11 | 43652a2587 |
12 | 1b88401ba8 |
13 | c67577561 |
14 | 6cab57528 |
15 | 3ea889192 |
hex | 26008bd70 |
10201120112 has 10 divisors (see below), whose sum is σ = 19764670248. Its totient is φ = 5100560048.
The previous prime is 10201120109. The next prime is 10201120133. The reversal of 10201120112 is 21102110201.
It is a junction number, because it is equal to n+sod(n) for n = 10201120093 and 10201120102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 318784988 + ... + 318785019.
Almost surely, 210201120112 is an apocalyptic number.
It is an amenable number.
10201120112 is a deficient number, since it is larger than the sum of its proper divisors (9563550136).
10201120112 is an equidigital number, since it uses as much as digits as its factorization.
10201120112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 637570015 (or 637570009 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10201120112 its reverse (21102110201), we get a palindrome (31303230313).
The spelling of 10201120112 in words is "ten billion, two hundred one million, one hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •