Base | Representation |
---|---|
bin | 1101000100001100… |
… | …10001010011011111 |
3 | 200002212001112112012 |
4 | 12202012101103133 |
5 | 103331204120111 |
6 | 3120013301435 |
7 | 335553302501 |
oct | 64206212337 |
9 | 20085045465 |
10 | 7014520031 |
11 | 2a7a5717a2 |
12 | 143919487b |
13 | 87a31ac8c |
14 | 4a7859d71 |
15 | 2b0c3648b |
hex | 1a21914df |
7014520031 has 2 divisors, whose sum is σ = 7014520032. Its totient is φ = 7014520030.
The previous prime is 7014519989. The next prime is 7014520057. The reversal of 7014520031 is 1300254107.
7014520031 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 7014520031 - 214 = 7014503647 is a prime.
It is a super-2 number, since 2×70145200312 = 98406982530600481922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 7014519979 and 7014520006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (7014520831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3507260015 + 3507260016.
It is an arithmetic number, because the mean of its divisors is an integer number (3507260016).
Almost surely, 27014520031 is an apocalyptic number.
7014520031 is a deficient number, since it is larger than the sum of its proper divisors (1).
7014520031 is an equidigital number, since it uses as much as digits as its factorization.
7014520031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 840, while the sum is 23.
The square root of 7014520031 is about 83752.7314838149. The cubic root of 7014520031 is about 1914.2529273981.
Adding to 7014520031 its reverse (1300254107), we get a palindrome (8314774138).
The spelling of 7014520031 in words is "seven billion, fourteen million, five hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •