Base | Representation |
---|---|
bin | 101100001111100001110… |
… | …111100101101011100011 |
3 | 101202122121220202211012201 |
4 | 230033201313211223203 |
5 | 344303044304333011 |
6 | 10244413043434031 |
7 | 432441146566333 |
oct | 54174167455343 |
9 | 11678556684181 |
10 | 3040331324131 |
11 | a72440853512 |
12 | 4112a0985917 |
13 | 190918429b3a |
14 | a721d4ad0c3 |
15 | 54145375cc1 |
hex | 2c3e1de5ae3 |
3040331324131 has 2 divisors, whose sum is σ = 3040331324132. Its totient is φ = 3040331324130.
The previous prime is 3040331324113. The next prime is 3040331324141. The reversal of 3040331324131 is 1314231330403.
Together with previous prime (3040331324113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3040331324131 - 227 = 3040197106403 is a prime.
It is a super-2 number, since 2×30403313241312 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3040331324131.
It is not a weakly prime, because it can be changed into another prime (3040331324141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1520165662065 + 1520165662066.
It is an arithmetic number, because the mean of its divisors is an integer number (1520165662066).
Almost surely, 23040331324131 is an apocalyptic number.
3040331324131 is a deficient number, since it is larger than the sum of its proper divisors (1).
3040331324131 is an equidigital number, since it uses as much as digits as its factorization.
3040331324131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 3040331324131 its reverse (1314231330403), we get a palindrome (4354562654534).
The spelling of 3040331324131 in words is "three trillion, forty billion, three hundred thirty-one million, three hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •