Base | Representation |
---|---|
bin | 11011100001000110100010… |
… | …100100100101101101001011 |
3 | 120212111120222201121011111111 |
4 | 123201012202210211231023 |
5 | 111330311044334000021 |
6 | 1105220425433511151 |
7 | 34330360333304335 |
oct | 3341064244455513 |
9 | 525446881534444 |
10 | 121022021000011 |
11 | 3561a1728a936a |
12 | 116a6a65b724b7 |
13 | 526b4349bab21 |
14 | 21c56d5d62455 |
15 | ded0d92978e1 |
hex | 6e11a2925b4b |
121022021000011 has 8 divisors (see below), whose sum is σ = 121651596823680. Its totient is φ = 120392471142912.
The previous prime is 121022020999961. The next prime is 121022021000063. The reversal of 121022021000011 is 110000120220121.
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 121022021000011 - 219 = 121022020475723 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121022020999955 and 121022021000000.
It is not an unprimeable number, because it can be changed into a prime (121022021000411) 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, 2889141 + ... + 15823753.
It is an arithmetic number, because the mean of its divisors is an integer number (15206449602960).
Almost surely, 2121022021000011 is an apocalyptic number.
121022021000011 is a deficient number, since it is larger than the sum of its proper divisors (629575823669).
121022021000011 is a wasteful number, since it uses less digits than its factorization.
121022021000011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12983285.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 121022021000011 its reverse (110000120220121), we get a palindrome (231022141220132).
The spelling of 121022021000011 in words is "one hundred twenty-one trillion, twenty-two billion, twenty-one million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •