Base | Representation |
---|---|
bin | 101011111100101100101… |
… | …101110111111001011111 |
3 | 101200201102210222112002202 |
4 | 223330230231313321133 |
5 | 343440142212411111 |
6 | 10231230450242115 |
7 | 431124124260056 |
oct | 53745455677137 |
9 | 11621383875082 |
10 | 3020112232031 |
11 | a64905691344 |
12 | 40939958633b |
13 | 18ba45541b0b |
14 | a626207539d |
15 | 5386027db3b |
hex | 2bf2cb77e5f |
3020112232031 has 2 divisors, whose sum is σ = 3020112232032. Its totient is φ = 3020112232030.
The previous prime is 3020112232001. The next prime is 3020112232079. The reversal of 3020112232031 is 1302322110203.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3020112232031 - 238 = 2745234325087 is a prime.
It is a super-2 number, since 2×30201122320312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3020112231994 and 3020112232012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3020112232001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1510056116015 + 1510056116016.
It is an arithmetic number, because the mean of its divisors is an integer number (1510056116016).
Almost surely, 23020112232031 is an apocalyptic number.
3020112232031 is a deficient number, since it is larger than the sum of its proper divisors (1).
3020112232031 is an equidigital number, since it uses as much as digits as its factorization.
3020112232031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 3020112232031 its reverse (1302322110203), we get a palindrome (4322434342234).
The spelling of 3020112232031 in words is "three trillion, twenty billion, one hundred twelve million, two hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •