Base | Representation |
---|---|
bin | 10011000000000110… |
… | …10101100100101001 |
3 | 222022221202221022221 |
4 | 21200003111210221 |
5 | 131343031001441 |
6 | 4404135514041 |
7 | 510541441312 |
oct | 114003254451 |
9 | 28287687287 |
10 | 10201422121 |
11 | 4365489480 |
12 | 1b88528921 |
13 | c67651b67 |
14 | 6cabd5609 |
15 | 3ea8e88d1 |
hex | 2600d5929 |
10201422121 has 8 divisors (see below), whose sum is σ = 11133957600. Its totient is φ = 9269742240.
The previous prime is 10201422113. The next prime is 10201422131. The reversal of 10201422121 is 12122410201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10201422121 - 23 = 10201422113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10201422095 and 10201422104.
It is not an unprimeable number, because it can be changed into a prime (10201422131) by changing a digit.
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 in 7 ways as a sum of consecutive naturals, for example, 188836 + ... + 236773.
It is an arithmetic number, because the mean of its divisors is an integer number (1391744700).
Almost surely, 210201422121 is an apocalyptic number.
10201422121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10201422121 is a deficient number, since it is larger than the sum of its proper divisors (932535479).
10201422121 is a wasteful number, since it uses less digits than its factorization.
10201422121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 427799.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 10201422121 its reverse (12122410201), we get a palindrome (22323832322).
The spelling of 10201422121 in words is "ten billion, two hundred one million, four hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •