Base | Representation |
---|---|
bin | 11011100100000001101110… |
… | …101000010110010000110011 |
3 | 120220012210210012120100102212 |
4 | 123210001232220112100303 |
5 | 111342104212314024021 |
6 | 1105453030002402335 |
7 | 34351034161351001 |
oct | 3344015650262063 |
9 | 526183705510385 |
10 | 121223013033011 |
11 | 3569743364164a |
12 | 117199b99603ab |
13 | 52843866b7a76 |
14 | 21d1321ab9a71 |
15 | e0344e87785b |
hex | 6e406ea16433 |
121223013033011 has 8 divisors (see below), whose sum is σ = 124054474974144. Its totient is φ = 118392111187560.
The previous prime is 121223013032999. The next prime is 121223013033013. The reversal of 121223013033011 is 110330310322121.
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 121223013033011 - 214 = 121223013016627 is a prime.
It is a super-2 number, since 2×1212230130330112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121223013033013) 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, 139585985 + ... + 140451746.
It is an arithmetic number, because the mean of its divisors is an integer number (15506809371768).
Almost surely, 2121223013033011 is an apocalyptic number.
121223013033011 is a deficient number, since it is larger than the sum of its proper divisors (2831461941133).
121223013033011 is a wasteful number, since it uses less digits than its factorization.
121223013033011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280047841.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 121223013033011 its reverse (110330310322121), we get a palindrome (231553323355132).
The spelling of 121223013033011 in words is "one hundred twenty-one trillion, two hundred twenty-three billion, thirteen million, thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •