Base | Representation |
---|---|
bin | 1001010110011011… |
… | …10111011010011111 |
3 | 110221212001120011201 |
4 | 10223031313122133 |
5 | 40240111204211 |
6 | 2150044300331 |
7 | 235254325624 |
oct | 45315673237 |
9 | 13855046151 |
10 | 5020022431 |
11 | 2146743176 |
12 | b812416a7 |
13 | 62004c298 |
14 | 3589d434b |
15 | 1e5aae0c1 |
hex | 12b37769f |
5020022431 has 4 divisors (see below), whose sum is σ = 5023277392. Its totient is φ = 5016767472.
The previous prime is 5020022383. The next prime is 5020022453. The reversal of 5020022431 is 1342200205.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5020022431 - 27 = 5020022303 is a prime.
It is a super-2 number, since 2×50200224312 = 50401250415486299522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5020022399 and 5020022408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5020022131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1625166 + ... + 1628251.
It is an arithmetic number, because the mean of its divisors is an integer number (1255819348).
Almost surely, 25020022431 is an apocalyptic number.
5020022431 is a deficient number, since it is larger than the sum of its proper divisors (3254961).
5020022431 is a wasteful number, since it uses less digits than its factorization.
5020022431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3254960.
The product of its (nonzero) digits is 480, while the sum is 19.
The square root of 5020022431 is about 70852.1166303449. The cubic root of 5020022431 is about 1712.2554316838.
Adding to 5020022431 its reverse (1342200205), we get a palindrome (6362222636).
The spelling of 5020022431 in words is "five billion, twenty million, twenty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •