Base | Representation |
---|---|
bin | 10011000110011010… |
… | …01110010011001011 |
3 | 222110122100201110002 |
4 | 21203031032103023 |
5 | 132000103023134 |
6 | 4413310113215 |
7 | 512053332533 |
oct | 114315162313 |
9 | 28418321402 |
10 | 10254345419 |
11 | 439234653a |
12 | 1ba21ab80b |
13 | c755c1a16 |
14 | 6d3c504c3 |
15 | 40039e87e |
hex | 26334e4cb |
10254345419 has 2 divisors, whose sum is σ = 10254345420. Its totient is φ = 10254345418.
The previous prime is 10254345401. The next prime is 10254345421. The reversal of 10254345419 is 91454345201.
10254345419 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (91454345201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10254345419 - 228 = 9985909963 is a prime.
It is a super-2 number, since 2×102543454192 (a number of 21 digits) contains 22 as substring.
Together with 10254345421, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10254345449) 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, 5127172709 + 5127172710.
It is an arithmetic number, because the mean of its divisors is an integer number (5127172710).
Almost surely, 210254345419 is an apocalyptic number.
10254345419 is a deficient number, since it is larger than the sum of its proper divisors (1).
10254345419 is an equidigital number, since it uses as much as digits as its factorization.
10254345419 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 86400, while the sum is 38.
The spelling of 10254345419 in words is "ten billion, two hundred fifty-four million, three hundred forty-five thousand, four hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •