Base | Representation |
---|---|
bin | 101011111100111110100… |
… | …111110101111111001111 |
3 | 101200202012202020220001102 |
4 | 223330332213311333033 |
5 | 343441301114004411 |
6 | 10231320341133315 |
7 | 431134432562456 |
oct | 53747647657717 |
9 | 11622182226042 |
10 | 3020412641231 |
11 | a64a4a215207 |
12 | 4094620ba23b |
13 | 18ba92853c3b |
14 | a628dd13b9d |
15 | 5387b81dd3b |
hex | 2bf3e9f5fcf |
3020412641231 has 2 divisors, whose sum is σ = 3020412641232. Its totient is φ = 3020412641230.
The previous prime is 3020412641149. The next prime is 3020412641243. The reversal of 3020412641231 is 1321462140203.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3020412641231 - 226 = 3020345532367 is a prime.
It is a super-2 number, since 2×30204126412312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3020412641194 and 3020412641203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3020412641291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1510206320615 + 1510206320616.
It is an arithmetic number, because the mean of its divisors is an integer number (1510206320616).
Almost surely, 23020412641231 is an apocalyptic number.
3020412641231 is a deficient number, since it is larger than the sum of its proper divisors (1).
3020412641231 is an equidigital number, since it uses as much as digits as its factorization.
3020412641231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 3020412641231 its reverse (1321462140203), we get a palindrome (4341874781434).
The spelling of 3020412641231 in words is "three trillion, twenty billion, four hundred twelve million, six hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •