Base | Representation |
---|---|
bin | 1001001100100010011111… |
… | …0000010110001101111001 |
3 | 1022210121022100221121022201 |
4 | 2103020213300112031321 |
5 | 2311124332110000441 |
6 | 33300534412550201 |
7 | 2062332333645115 |
oct | 223104760261571 |
9 | 38717270847281 |
10 | 10111020000121 |
11 | 3249072218337 |
12 | 1173700182361 |
13 | 584607a75aa1 |
14 | 26d539988745 |
15 | 12802686cc31 |
hex | 93227c16379 |
10111020000121 has 8 divisors (see below), whose sum is σ = 10137986330688. Its totient is φ = 10084089318000.
The previous prime is 10111020000089. The next prime is 10111020000127. The reversal of 10111020000121 is 12100002011101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10111020000121 - 25 = 10111020000089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10111020000098 and 10111020000107.
It is not an unprimeable number, because it can be changed into a prime (10111020000127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8344045 + ... + 9478666.
It is an arithmetic number, because the mean of its divisors is an integer number (1267248291336).
Almost surely, 210111020000121 is an apocalyptic number.
It is an amenable number.
10111020000121 is a deficient number, since it is larger than the sum of its proper divisors (26966330567).
10111020000121 is an equidigital number, since it uses as much as digits as its factorization.
10111020000121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17824223.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10111020000121 its reverse (12100002011101), we get a palindrome (22211022011222).
The spelling of 10111020000121 in words is "ten trillion, one hundred eleven billion, twenty million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •