Base | Representation |
---|---|
bin | 100001111100000001111… |
… | …101010110110011011011 |
3 | 22020221211000221121012110 |
4 | 201330001331112303123 |
5 | 301202321211300011 |
6 | 4543221542043403 |
7 | 330332043535203 |
oct | 41740175266333 |
9 | 8227730847173 |
10 | 2332200103131 |
11 | 81a098181168 |
12 | 317bb5119563 |
13 | 13bc054c4632 |
14 | 80c44303403 |
15 | 409ec502ba6 |
hex | 21f01f56cdb |
2332200103131 has 32 divisors (see below), whose sum is σ = 3278612275200. Its totient is φ = 1470563246880.
The previous prime is 2332200103117. The next prime is 2332200103141. The reversal of 2332200103131 is 1313010022332.
It is not a de Polignac number, because 2332200103131 - 211 = 2332200101083 is a prime.
It is a super-2 number, since 2×23322001031312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2332200103098 and 2332200103107.
It is not an unprimeable number, because it can be changed into a prime (2332200103141) 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, 105868140 + ... + 105890166.
It is an arithmetic number, because the mean of its divisors is an integer number (102456633600).
Almost surely, 22332200103131 is an apocalyptic number.
2332200103131 is a deficient number, since it is larger than the sum of its proper divisors (946412172069).
2332200103131 is a wasteful number, since it uses less digits than its factorization.
2332200103131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24999.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 2332200103131 its reverse (1313010022332), we get a palindrome (3645210125463).
The spelling of 2332200103131 in words is "two trillion, three hundred thirty-two billion, two hundred million, one hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •