Base | Representation |
---|---|
bin | 101100000111111000100… |
… | …011100000011011101011 |
3 | 101201212102210111000010201 |
4 | 230013320203200123223 |
5 | 344134241213014011 |
6 | 10240534305253031 |
7 | 432030544522126 |
oct | 54077043403353 |
9 | 11655383430121 |
10 | 3032122001131 |
11 | a69a08905653 |
12 | 40b78b634177 |
13 | 18cc0a717072 |
14 | a6a810b73bd |
15 | 53d147cdcc1 |
hex | 2c1f88e06eb |
3032122001131 has 2 divisors, whose sum is σ = 3032122001132. Its totient is φ = 3032122001130.
The previous prime is 3032122001107. The next prime is 3032122001137. The reversal of 3032122001131 is 1311002212303.
3032122001131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3032122001131 - 27 = 3032122001003 is a prime.
It is a super-2 number, since 2×30321220011312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3032122001099 and 3032122001108.
It is not a weakly prime, because it can be changed into another prime (3032122001137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1516061000565 + 1516061000566.
It is an arithmetic number, because the mean of its divisors is an integer number (1516061000566).
Almost surely, 23032122001131 is an apocalyptic number.
3032122001131 is a deficient number, since it is larger than the sum of its proper divisors (1).
3032122001131 is an equidigital number, since it uses as much as digits as its factorization.
3032122001131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 3032122001131 its reverse (1311002212303), we get a palindrome (4343124213434).
The spelling of 3032122001131 in words is "three trillion, thirty-two billion, one hundred twenty-two million, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •