Base | Representation |
---|---|
bin | 111000110110111001… |
… | …0101110111100101011 |
3 | 102200011102202120022020 |
4 | 1301231302232330223 |
5 | 4000030340202311 |
6 | 132031550155523 |
7 | 11551531141230 |
oct | 1615562567453 |
9 | 380142676266 |
10 | 122101100331 |
11 | 47867984981 |
12 | 1b7b74b2ba3 |
13 | b68b59bcc2 |
14 | 5ca43db787 |
15 | 3299688c06 |
hex | 1c6dcaef2b |
122101100331 has 16 divisors (see below), whose sum is σ = 186094233600. Its totient is φ = 69758777088.
The previous prime is 122101100327. The next prime is 122101100399. The reversal of 122101100331 is 133001101221.
It is a happy number.
It is not a de Polignac number, because 122101100331 - 22 = 122101100327 is a prime.
It is a super-2 number, since 2×1221011003312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 122101100331.
It is not an unprimeable number, because it can be changed into a prime (122101100131) 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 15 ways as a sum of consecutive naturals, for example, 439846 + ... + 661563.
It is an arithmetic number, because the mean of its divisors is an integer number (11630889600).
Almost surely, 2122101100331 is an apocalyptic number.
122101100331 is a deficient number, since it is larger than the sum of its proper divisors (63993133269).
122101100331 is a wasteful number, since it uses less digits than its factorization.
122101100331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1106698.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 122101100331 its reverse (133001101221), we get a palindrome (255102201552).
The spelling of 122101100331 in words is "one hundred twenty-two billion, one hundred one million, one hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •