Base | Representation |
---|---|
bin | 1001001011111001111000… |
… | …1000110011101111101001 |
3 | 1022202120011210222022120021 |
4 | 2102332132020303233221 |
5 | 2310440022013101441 |
6 | 33251533122200441 |
7 | 2061465263604130 |
oct | 222763610635751 |
9 | 38676153868507 |
10 | 10100121222121 |
11 | 324448a136097 |
12 | 117157a1b3121 |
13 | 58358bacc218 |
14 | 26cbc4306917 |
15 | 127ad9b253d1 |
hex | 92f9e233be9 |
10100121222121 has 8 divisors (see below), whose sum is σ = 11573134055424. Its totient is φ = 8634642982080.
The previous prime is 10100121222077. The next prime is 10100121222157. The reversal of 10100121222121 is 12122212100101.
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 10100121222121 - 211 = 10100121220073 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10100121222095 and 10100121222104.
It is not an unprimeable number, because it can be changed into a prime (10100121222161) 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, 1883645440 + ... + 1883650801.
It is an arithmetic number, because the mean of its divisors is an integer number (1446641756928).
Almost surely, 210100121222121 is an apocalyptic number.
It is an amenable number.
10100121222121 is a deficient number, since it is larger than the sum of its proper divisors (1473012833303).
10100121222121 is an equidigital number, since it uses as much as digits as its factorization.
10100121222121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3767296631.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10100121222121 its reverse (12122212100101), we get a palindrome (22222333322222).
The spelling of 10100121222121 in words is "ten trillion, one hundred billion, one hundred twenty-one million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •