Base | Representation |
---|---|
bin | 1001001101001000011111… |
… | …0110010001010010000101 |
3 | 1022211120122100222222111112 |
4 | 2103102013312101102011 |
5 | 2311311230324200401 |
6 | 33305343015214405 |
7 | 2063143214241620 |
oct | 223220766212205 |
9 | 38746570888445 |
10 | 10121222100101 |
11 | 325242801a022 |
12 | 1175688977405 |
13 | 5855725a4338 |
14 | 26dc268b8db7 |
15 | 12842234c3bb |
hex | 93487d91485 |
10121222100101 has 8 divisors (see below), whose sum is σ = 12070028840064. Its totient is φ = 8298144827280.
The previous prime is 10121222100083. The next prime is 10121222100109. The reversal of 10121222100101 is 10100122212101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10121222100101 - 210 = 10121222099077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121222100109) 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 7 ways as a sum of consecutive naturals, for example, 31432366610 + ... + 31432366931.
It is an arithmetic number, because the mean of its divisors is an integer number (1508753605008).
Almost surely, 210121222100101 is an apocalyptic number.
It is an amenable number.
10121222100101 is a deficient number, since it is larger than the sum of its proper divisors (1948806739963).
10121222100101 is an equidigital number, since it uses as much as digits as its factorization.
10121222100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62864733571.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10121222100101 its reverse (10100122212101), we get a palindrome (20221344312202).
The spelling of 10121222100101 in words is "ten trillion, one hundred twenty-one billion, two hundred twenty-two million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •