Base | Representation |
---|---|
bin | 10010111001001111… |
… | …11000011011100011 |
3 | 222011221112011111212 |
4 | 21130213320123203 |
5 | 131233314040334 |
6 | 4354322500335 |
7 | 506242445465 |
oct | 113447703343 |
9 | 28157464455 |
10 | 10143893219 |
11 | 4335a66129 |
12 | 1b712046ab |
13 | c5875b8a5 |
14 | 6c32dc135 |
15 | 3e5832ece |
hex | 25c9f86e3 |
10143893219 has 2 divisors, whose sum is σ = 10143893220. Its totient is φ = 10143893218.
The previous prime is 10143893141. The next prime is 10143893257. The reversal of 10143893219 is 91239834101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10143893219 - 220 = 10142844643 is a prime.
It is a super-2 number, since 2×101438932192 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (10143893119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5071946609 + 5071946610.
It is an arithmetic number, because the mean of its divisors is an integer number (5071946610).
Almost surely, 210143893219 is an apocalyptic number.
10143893219 is a deficient number, since it is larger than the sum of its proper divisors (1).
10143893219 is an equidigital number, since it uses as much as digits as its factorization.
10143893219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 41.
The spelling of 10143893219 in words is "ten billion, one hundred forty-three million, eight hundred ninety-three thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •