Base | Representation |
---|---|
bin | 11011100010011010011011… |
… | …110000100110100100110001 |
3 | 120212211012111120001102011020 |
4 | 123202122123300212210301 |
5 | 111333300040330201001 |
6 | 1105330044153210053 |
7 | 34340026523665215 |
oct | 3342323360464461 |
9 | 525735446042136 |
10 | 121112101022001 |
11 | 35654398706131 |
12 | 11700405700929 |
13 | 5276a8c27a49b |
14 | 21c9bdd730945 |
15 | e0060c67e736 |
hex | 6e269bc26931 |
121112101022001 has 8 divisors (see below), whose sum is σ = 161483452288704. Its totient is φ = 80741075218320.
The previous prime is 121112101021931. The next prime is 121112101022039. The reversal of 121112101022001 is 100220101211121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121112101022001 - 213 = 121112101013809 is a prime.
It is not an unprimeable number, because it can be changed into a prime (121112101022041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80496141 + ... + 81986906.
It is an arithmetic number, because the mean of its divisors is an integer number (20185431536088).
Almost surely, 2121112101022001 is an apocalyptic number.
It is an amenable number.
121112101022001 is a deficient number, since it is larger than the sum of its proper divisors (40371351266703).
121112101022001 is a wasteful number, since it uses less digits than its factorization.
121112101022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162731511.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 121112101022001 its reverse (100220101211121), we get a palindrome (221332202233122).
The spelling of 121112101022001 in words is "one hundred twenty-one trillion, one hundred twelve billion, one hundred one million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •