Base | Representation |
---|---|
bin | 101100001111011011011… |
… | …000011101100010100111 |
3 | 101202122100100000000222112 |
4 | 230033123120131202213 |
5 | 344302333430013111 |
6 | 10244354155151235 |
7 | 432435355605662 |
oct | 54173330354247 |
9 | 11678310000875 |
10 | 3040222501031 |
11 | a72395386071 |
12 | 41127044551b |
13 | 1908cba17381 |
14 | a720cc626d9 |
15 | 5413aa2be8b |
hex | 2c3db61d8a7 |
3040222501031 has 2 divisors, whose sum is σ = 3040222501032. Its totient is φ = 3040222501030.
The previous prime is 3040222501003. The next prime is 3040222501051. The reversal of 3040222501031 is 1301052220403.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3040222501031 - 26 = 3040222500967 is a prime.
It is a super-2 number, since 2×30402225010312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3040222500988 and 3040222501006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3040222501051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1520111250515 + 1520111250516.
It is an arithmetic number, because the mean of its divisors is an integer number (1520111250516).
Almost surely, 23040222501031 is an apocalyptic number.
3040222501031 is a deficient number, since it is larger than the sum of its proper divisors (1).
3040222501031 is an equidigital number, since it uses as much as digits as its factorization.
3040222501031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 3040222501031 its reverse (1301052220403), we get a palindrome (4341274721434).
The spelling of 3040222501031 in words is "three trillion, forty billion, two hundred twenty-two million, five hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •