Base | Representation |
---|---|
bin | 1001010101110000… |
… | …00010110101000101 |
3 | 110221110021221020200 |
4 | 10222320002311011 |
5 | 40232130131041 |
6 | 2145321521113 |
7 | 235154602221 |
oct | 45270026505 |
9 | 13843257220 |
10 | 5014302021 |
11 | 2143496363 |
12 | b7b343199 |
13 | 61bac8621 |
14 | 357d45781 |
15 | 1e532e1b6 |
hex | 12ae02d45 |
5014302021 has 12 divisors (see below), whose sum is σ = 7250773920. Its totient is φ = 3339225000.
The previous prime is 5014302017. The next prime is 5014302023. The reversal of 5014302021 is 1202034105.
5014302021 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5014302021 - 22 = 5014302017 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5014301985 and 5014302003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5014302023) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 294855 + ... + 311396.
It is an arithmetic number, because the mean of its divisors is an integer number (604231160).
Almost surely, 25014302021 is an apocalyptic number.
It is an amenable number.
5014302021 is a deficient number, since it is larger than the sum of its proper divisors (2236471899).
5014302021 is a wasteful number, since it uses less digits than its factorization.
5014302021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 607176 (or 607173 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 5014302021 is about 70811.7364636682. The cubic root of 5014302021 is about 1711.6048020608.
Adding to 5014302021 its reverse (1202034105), we get a palindrome (6216336126).
The spelling of 5014302021 in words is "five billion, fourteen million, three hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.969 sec. • engine limits •