Base | Representation |
---|---|
bin | 1001000111001111011010… |
… | …0011000100000100001101 |
3 | 1022110220101000222200012100 |
4 | 2101303312203010010031 |
5 | 2303131430012333401 |
6 | 33151042521025313 |
7 | 2052630641514255 |
oct | 221636643040415 |
9 | 38426330880170 |
10 | 10020000121101 |
11 | 3213504936023 |
12 | 1159b39925239 |
13 | 578b608762c9 |
14 | 268d83446965 |
15 | 12599abd4b86 |
hex | 91cf68c410d |
10020000121101 has 24 divisors (see below), whose sum is σ = 14509880925696. Its totient is φ = 6663153180960.
The previous prime is 10020000121097. The next prime is 10020000121111. The reversal of 10020000121101 is 10112100002001.
It is a happy number.
It is not a de Polignac number, because 10020000121101 - 22 = 10020000121097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10020000121111) 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, 4813216 + ... + 6573206.
It is an arithmetic number, because the mean of its divisors is an integer number (604578371904).
Almost surely, 210020000121101 is an apocalyptic number.
It is an amenable number.
10020000121101 is a deficient number, since it is larger than the sum of its proper divisors (4489880804595).
10020000121101 is a wasteful number, since it uses less digits than its factorization.
10020000121101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1761593 (or 1761590 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10020000121101 its reverse (10112100002001), we get a palindrome (20132100123102).
The spelling of 10020000121101 in words is "ten trillion, twenty billion, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •