Base | Representation |
---|---|
bin | 101011111100111000101… |
… | …100001010110111011111 |
3 | 101200201221210222021122202 |
4 | 223330320230022313133 |
5 | 343441100124041111 |
6 | 10231302424002115 |
7 | 431132113601045 |
oct | 53747054126737 |
9 | 11621853867582 |
10 | 3020313112031 |
11 | a649a9015476 |
12 | 40943490033b |
13 | 18ba78046817 |
14 | a6280a06395 |
15 | 53872c0db3b |
hex | 2bf38b0addf |
3020313112031 has 2 divisors, whose sum is σ = 3020313112032. Its totient is φ = 3020313112030.
The previous prime is 3020313112007. The next prime is 3020313112109. The reversal of 3020313112031 is 1302113130203.
It is a weak prime.
It is an emirp because it is prime and its reverse (1302113130203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3020313112031 - 214 = 3020313095647 is a prime.
It is a super-2 number, since 2×30203131120312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3020313111994 and 3020313112012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3020313112631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1510156556015 + 1510156556016.
It is an arithmetic number, because the mean of its divisors is an integer number (1510156556016).
Almost surely, 23020313112031 is an apocalyptic number.
3020313112031 is a deficient number, since it is larger than the sum of its proper divisors (1).
3020313112031 is an equidigital number, since it uses as much as digits as its factorization.
3020313112031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 3020313112031 its reverse (1302113130203), we get a palindrome (4322426242234).
The spelling of 3020313112031 in words is "three trillion, twenty billion, three hundred thirteen million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •