Base | Representation |
---|---|
bin | 11011100001000110100111… |
… | …010110100100011110000011 |
3 | 120212111121012022112022022021 |
4 | 123201012213112210132003 |
5 | 111330311230402223021 |
6 | 1105220441421022311 |
7 | 34330362326136550 |
oct | 3341064726443603 |
9 | 525447168468267 |
10 | 121022101211011 |
11 | 3561a204104050 |
12 | 116a6a889b4997 |
13 | 526b4484c3260 |
14 | 21c5702881a27 |
15 | ded0e133dc41 |
hex | 6e11a75a4783 |
121022101211011 has 32 divisors (see below), whose sum is σ = 163388954566656. Its totient is φ = 86567930928000.
The previous prime is 121022101211009. The next prime is 121022101211023. The reversal of 121022101211011 is 110112101220121.
It is a cyclic number.
It is not a de Polignac number, because 121022101211011 - 21 = 121022101211009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (121022101221011) 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 31 ways as a sum of consecutive naturals, for example, 333800035 + ... + 334162396.
It is an arithmetic number, because the mean of its divisors is an integer number (5105904830208).
Almost surely, 2121022101211011 is an apocalyptic number.
121022101211011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
121022101211011 is a deficient number, since it is larger than the sum of its proper divisors (42366853355645).
121022101211011 is a wasteful number, since it uses less digits than its factorization.
121022101211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 667962643.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 121022101211011 its reverse (110112101220121), we get a palindrome (231134202431132).
The spelling of 121022101211011 in words is "one hundred twenty-one trillion, twenty-two billion, one hundred one million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •