Base | Representation |
---|---|
bin | 101111100000110110… |
… | …0111111000010000011 |
3 | 100202100221001102201001 |
4 | 1133001230333002003 |
5 | 3132431203334021 |
6 | 114512423352431 |
7 | 10241333025025 |
oct | 1370154770203 |
9 | 322327042631 |
10 | 102034043011 |
11 | 3a2aa61478a |
12 | 17936bb2717 |
13 | 98110460a4 |
14 | 4d1d25c015 |
15 | 29c2ac4091 |
hex | 17c1b3f083 |
102034043011 has 2 divisors, whose sum is σ = 102034043012. Its totient is φ = 102034043010.
The previous prime is 102034042939. The next prime is 102034043057. The reversal of 102034043011 is 110340430201.
It is a strong prime.
It is an emirp because it is prime and its reverse (110340430201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102034043011 - 27 = 102034042883 is a prime.
It is a super-2 number, since 2×1020340430112 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102034043011.
It is not a weakly prime, because it can be changed into another prime (102034043071) 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, 51017021505 + 51017021506.
It is an arithmetic number, because the mean of its divisors is an integer number (51017021506).
Almost surely, 2102034043011 is an apocalyptic number.
102034043011 is a deficient number, since it is larger than the sum of its proper divisors (1).
102034043011 is an equidigital number, since it uses as much as digits as its factorization.
102034043011 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 19.
Adding to 102034043011 its reverse (110340430201), we get a palindrome (212374473212).
The spelling of 102034043011 in words is "one hundred two billion, thirty-four million, forty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •