Base | Representation |
---|---|
bin | 10010101001110010… |
… | …01100010100110111 |
3 | 221211220111202021202 |
4 | 21110321030110313 |
5 | 131002114312211 |
6 | 4333411203115 |
7 | 503106260345 |
oct | 112471142467 |
9 | 27756452252 |
10 | 10014213431 |
11 | 4279842852 |
12 | 1b358a649b |
13 | c37925aa1 |
14 | 6addc2995 |
15 | 3d926953b |
hex | 254e4c537 |
10014213431 has 2 divisors, whose sum is σ = 10014213432. Its totient is φ = 10014213430.
The previous prime is 10014213403. The next prime is 10014213463. The reversal of 10014213431 is 13431241001.
10014213431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (13431241001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10014213431 - 214 = 10014197047 is a prime.
It is a super-2 number, since 2×100142134312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10014212431) 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, 5007106715 + 5007106716.
It is an arithmetic number, because the mean of its divisors is an integer number (5007106716).
Almost surely, 210014213431 is an apocalyptic number.
10014213431 is a deficient number, since it is larger than the sum of its proper divisors (1).
10014213431 is an equidigital number, since it uses as much as digits as its factorization.
10014213431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 10014213431 its reverse (13431241001), we get a palindrome (23445454432).
The spelling of 10014213431 in words is "ten billion, fourteen million, two hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •