Base | Representation |
---|---|
bin | 11011100010011000101011… |
… | …000110101111101010110011 |
3 | 120212211000121211122101202211 |
4 | 123202120223012233222303 |
5 | 111333232203004013021 |
6 | 1105325132435352551 |
7 | 34336631634040021 |
oct | 3342305306575263 |
9 | 525730554571684 |
10 | 121110211001011 |
11 | 35653608856411 |
12 | 116bbb78752757 |
13 | 527684a82ba7b |
14 | 21c9aa0703711 |
15 | e0054b7933e1 |
hex | 6e262b1afab3 |
121110211001011 has 8 divisors (see below), whose sum is σ = 128697280924320. Its totient is φ = 113574578840448.
The previous prime is 121110211000993. The next prime is 121110211001053. The reversal of 121110211001011 is 110100112011121.
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 121110211001011 - 235 = 121075851262643 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121110211000982 and 121110211001000.
It is not an unprimeable number, because it can be changed into a prime (121110211005011) 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, 12859435831 + ... + 12859445248.
It is an arithmetic number, because the mean of its divisors is an integer number (16087160115540).
Almost surely, 2121110211001011 is an apocalyptic number.
121110211001011 is a deficient number, since it is larger than the sum of its proper divisors (7587069923309).
121110211001011 is a wasteful number, since it uses less digits than its factorization.
121110211001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25718881373.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 121110211001011 its reverse (110100112011121), we get a palindrome (231210323012132).
The spelling of 121110211001011 in words is "one hundred twenty-one trillion, one hundred ten billion, two hundred eleven million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •