Base | Representation |
---|---|
bin | 1001010110101101… |
… | …00011100100001111 |
3 | 110222000100022000002 |
4 | 10223112203210033 |
5 | 40241202103211 |
6 | 2150205154515 |
7 | 235312564211 |
oct | 45326434417 |
9 | 13860308002 |
10 | 5022300431 |
11 | 2147a59715 |
12 | b81b5ba3b |
13 | 620669105 |
14 | 3590285b1 |
15 | 1e5dae03b |
hex | 12b5a390f |
5022300431 has 2 divisors, whose sum is σ = 5022300432. Its totient is φ = 5022300430.
The previous prime is 5022300391. The next prime is 5022300433. The reversal of 5022300431 is 1340032205.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5022300431 is a prime.
It is a super-2 number, since 2×50223004312 = 50447003238445571522, which contains 22 as substring.
Together with 5022300433, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5022300433) 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, 2511150215 + 2511150216.
It is an arithmetic number, because the mean of its divisors is an integer number (2511150216).
Almost surely, 25022300431 is an apocalyptic number.
5022300431 is a deficient number, since it is larger than the sum of its proper divisors (1).
5022300431 is an equidigital number, since it uses as much as digits as its factorization.
5022300431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 20.
The square root of 5022300431 is about 70868.1905441362. The cubic root of 5022300431 is about 1712.5143898910.
Adding to 5022300431 its reverse (1340032205), we get a palindrome (6362332636).
The spelling of 5022300431 in words is "five billion, twenty-two million, three hundred thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •