Base | Representation |
---|---|
bin | 1001010110111001… |
… | …10001101000110011 |
3 | 110222010102010121222 |
4 | 10223130301220303 |
5 | 40242111242211 |
6 | 2150304135255 |
7 | 235332464645 |
oct | 45334615063 |
9 | 13863363558 |
10 | 5023930931 |
11 | 2148972738 |
12 | b8260752b |
13 | 620aba2c6 |
14 | 359330895 |
15 | 1e60d21db |
hex | 12b731a33 |
5023930931 has 2 divisors, whose sum is σ = 5023930932. Its totient is φ = 5023930930.
The previous prime is 5023930921. The next prime is 5023930939. The reversal of 5023930931 is 1390393205.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5023930931 - 222 = 5019736627 is a prime.
It is a super-2 number, since 2×50239309312 = 50479763998917053522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5023930891 and 5023930900.
It is not a weakly prime, because it can be changed into another prime (5023930939) 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, 2511965465 + 2511965466.
It is an arithmetic number, because the mean of its divisors is an integer number (2511965466).
Almost surely, 25023930931 is an apocalyptic number.
5023930931 is a deficient number, since it is larger than the sum of its proper divisors (1).
5023930931 is an equidigital number, since it uses as much as digits as its factorization.
5023930931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21870, while the sum is 35.
The square root of 5023930931 is about 70879.6933613570. The cubic root of 5023930931 is about 1712.6996935936.
The spelling of 5023930931 in words is "five billion, twenty-three million, nine hundred thirty thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •