Base | Representation |
---|---|
bin | 1000010100101110… |
… | …0100011001111111 |
3 | 12202201102101220121 |
4 | 2011023210121333 |
5 | 14034001334211 |
6 | 1005414555411 |
7 | 106241051542 |
oct | 20513443177 |
9 | 5681371817 |
10 | 2234402431 |
11 | a47297688 |
12 | 524368b67 |
13 | 297bb8421 |
14 | 172a74859 |
15 | d1265271 |
hex | 852e467f |
2234402431 has 2 divisors, whose sum is σ = 2234402432. Its totient is φ = 2234402430.
The previous prime is 2234402377. The next prime is 2234402437. The reversal of 2234402431 is 1342044322.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2234402431 - 215 = 2234369663 is a prime.
It is a super-2 number, since 2×22344024312 = 9985108447317419522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2234402396 and 2234402405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2234402437) 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, 1117201215 + 1117201216.
It is an arithmetic number, because the mean of its divisors is an integer number (1117201216).
Almost surely, 22234402431 is an apocalyptic number.
2234402431 is a deficient number, since it is larger than the sum of its proper divisors (1).
2234402431 is an equidigital number, since it uses as much as digits as its factorization.
2234402431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 25.
The square root of 2234402431 is about 47269.4661594565. The cubic root of 2234402431 is about 1307.3357328665.
Adding to 2234402431 its reverse (1342044322), we get a palindrome (3576446753).
The spelling of 2234402431 in words is "two billion, two hundred thirty-four million, four hundred two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •