Base | Representation |
---|---|
bin | 11011100011111110111011… |
… | …110001000111101101000011 |
3 | 120220012112001001222210112022 |
4 | 123203332323301013231003 |
5 | 111342032041111223021 |
6 | 1105451412124352055 |
7 | 34350566622652550 |
oct | 3343767361075503 |
9 | 526175031883468 |
10 | 121220012211011 |
11 | 3569613376a66a |
12 | 117193009a562b |
13 | 5283cc8aa634c |
14 | 21d111933ba27 |
15 | e033261c01ab |
hex | 6e3fbbc47b43 |
121220012211011 has 8 divisors (see below), whose sum is σ = 139882177753344. Its totient is φ = 102894101903880.
The previous prime is 121220012210993. The next prime is 121220012211037. The reversal of 121220012211011 is 110112210022121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121220012211011 - 226 = 121219945102147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121220012211041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 84063808025 + ... + 84063809466.
It is an arithmetic number, because the mean of its divisors is an integer number (17485272219168).
Almost surely, 2121220012211011 is an apocalyptic number.
121220012211011 is a deficient number, since it is larger than the sum of its proper divisors (18662165542333).
121220012211011 is a wasteful number, since it uses less digits than its factorization.
121220012211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168127617601.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 121220012211011 its reverse (110112210022121), we get a palindrome (231332222233132).
The spelling of 121220012211011 in words is "one hundred twenty-one trillion, two hundred twenty billion, twelve million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •