Base | Representation |
---|---|
bin | 11011110001000110010000… |
… | …100010001010110010000011 |
3 | 121000101200020111021010202220 |
4 | 123301012100202022302003 |
5 | 112001313234340101311 |
6 | 1111421415113342123 |
7 | 34502652631544166 |
oct | 3361062042126203 |
9 | 530350214233686 |
10 | 122121230003331 |
11 | 35a03360708899 |
12 | 11843ab4a07943 |
13 | 531aca0946210 |
14 | 22229b0365add |
15 | e1b9c059e206 |
hex | 6f119088ac83 |
122121230003331 has 32 divisors (see below), whose sum is σ = 184596900106752. Its totient is φ = 71247926238720.
The previous prime is 122121230003329. The next prime is 122121230003447. The reversal of 122121230003331 is 133300032121221.
It is not a de Polignac number, because 122121230003331 - 21 = 122121230003329 is a prime.
It is a super-2 number, since 2×1221212300033312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (122121230003831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 602306025 + ... + 602508746.
It is an arithmetic number, because the mean of its divisors is an integer number (5768653128336).
Almost surely, 2122121230003331 is an apocalyptic number.
122121230003331 is a deficient number, since it is larger than the sum of its proper divisors (62475670103421).
122121230003331 is a wasteful number, since it uses less digits than its factorization.
122121230003331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1204814923.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 122121230003331 its reverse (133300032121221), we get a palindrome (255421262124552).
The spelling of 122121230003331 in words is "one hundred twenty-two trillion, one hundred twenty-one billion, two hundred thirty million, three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •