Base | Representation |
---|---|
bin | 11101011001101110001… |
… | …01001110011010110011 |
3 | 10120120121110111000222102 |
4 | 32230313011032122303 |
5 | 113022433301244334 |
6 | 2052033135531015 |
7 | 132662503324046 |
oct | 16546705163263 |
9 | 3516543430872 |
10 | 1010241431219 |
11 | 35a493a50839 |
12 | 14395b989a6b |
13 | 7435acb8407 |
14 | 36c78694c5d |
15 | 1b42a91467e |
hex | eb3714e6b3 |
1010241431219 has 2 divisors, whose sum is σ = 1010241431220. Its totient is φ = 1010241431218.
The previous prime is 1010241431203. The next prime is 1010241431261. The reversal of 1010241431219 is 9121341420101.
It is a weak prime.
It is an emirp because it is prime and its reverse (9121341420101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1010241431219 - 24 = 1010241431203 is a prime.
It is a super-2 number, since 2×10102414312192 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1010241431191 and 1010241431200.
It is not a weakly prime, because it can be changed into another prime (1010241431119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505120715609 + 505120715610.
It is an arithmetic number, because the mean of its divisors is an integer number (505120715610).
Almost surely, 21010241431219 is an apocalyptic number.
1010241431219 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010241431219 is an equidigital number, since it uses as much as digits as its factorization.
1010241431219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 29.
The spelling of 1010241431219 in words is "one trillion, ten billion, two hundred forty-one million, four hundred thirty-one thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •