Base | Representation |
---|---|
bin | 101111100000001011… |
… | …1010001110110111011 |
3 | 100202022100202222101212 |
4 | 1133000113101312323 |
5 | 3132404430410424 |
6 | 114510302033335 |
7 | 10240641041543 |
oct | 1370027216673 |
9 | 322270688355 |
10 | 102011575739 |
11 | 3a298969797 |
12 | 1792b57884b |
13 | 98094aa948 |
14 | 4d1a290323 |
15 | 29c0b3710e |
hex | 17c05d1dbb |
102011575739 has 2 divisors, whose sum is σ = 102011575740. Its totient is φ = 102011575738.
The previous prime is 102011575727. The next prime is 102011575777. The reversal of 102011575739 is 937575110201.
It is a weak prime.
It is an emirp because it is prime and its reverse (937575110201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102011575739 - 28 = 102011575483 is a prime.
It is a super-2 number, since 2×1020115757392 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102011575696 and 102011575705.
It is not a weakly prime, because it can be changed into another prime (102011572739) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51005787869 + 51005787870.
It is an arithmetic number, because the mean of its divisors is an integer number (51005787870).
Almost surely, 2102011575739 is an apocalyptic number.
102011575739 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011575739 is an equidigital number, since it uses as much as digits as its factorization.
102011575739 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 66150, while the sum is 41.
The spelling of 102011575739 in words is "one hundred two billion, eleven million, five hundred seventy-five thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •