Base | Representation |
---|---|
bin | 1011010101010100… |
… | …1010000101011111 |
3 | 21212000110220121212 |
4 | 2311111022011133 |
5 | 22212302104211 |
6 | 1221513215035 |
7 | 135250315103 |
oct | 26525120537 |
9 | 7760426555 |
10 | 3042222431 |
11 | 1321289816 |
12 | 70aa0147b |
13 | 396378821 |
14 | 20c077903 |
15 | 12c13438b |
hex | b554a15f |
3042222431 has 2 divisors, whose sum is σ = 3042222432. Its totient is φ = 3042222430.
The previous prime is 3042222401. The next prime is 3042222451. The reversal of 3042222431 is 1342222403.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3042222431 is a prime.
It is a super-2 number, since 2×30422224312 = 18510234639359099522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3042222397 and 3042222406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3042222401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1521111215 + 1521111216.
It is an arithmetic number, because the mean of its divisors is an integer number (1521111216).
Almost surely, 23042222431 is an apocalyptic number.
3042222431 is a deficient number, since it is larger than the sum of its proper divisors (1).
3042222431 is an equidigital number, since it uses as much as digits as its factorization.
3042222431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 23.
The square root of 3042222431 is about 55156.3453375947. The cubic root of 3042222431 is about 1448.9842161943.
Adding to 3042222431 its reverse (1342222403), we get a palindrome (4384444834).
The spelling of 3042222431 in words is "three billion, forty-two million, two hundred twenty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •