Base | Representation |
---|---|
bin | 101111101100011111… |
… | …0100001001110110111 |
3 | 100210101010210111021111 |
4 | 1133120332201032313 |
5 | 3134231133444021 |
6 | 115015252455451 |
7 | 10254114005563 |
oct | 1373076411667 |
9 | 323333714244 |
10 | 102424515511 |
11 | 3a48aa7252a |
12 | 17a2591a587 |
13 | 9873bccbc6 |
14 | 4d590626a3 |
15 | 29e70048e1 |
hex | 17d8fa13b7 |
102424515511 has 4 divisors (see below), whose sum is σ = 104806481032. Its totient is φ = 100042549992.
The previous prime is 102424515467. The next prime is 102424515527. The reversal of 102424515511 is 115515424201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102424515511 - 211 = 102424513463 is a prime.
It is a super-2 number, since 2×1024245155112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102424015511) 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 in 3 ways as a sum of consecutive naturals, for example, 1190982696 + ... + 1190982781.
It is an arithmetic number, because the mean of its divisors is an integer number (26201620258).
Almost surely, 2102424515511 is an apocalyptic number.
102424515511 is a deficient number, since it is larger than the sum of its proper divisors (2381965521).
102424515511 is an equidigital number, since it uses as much as digits as its factorization.
102424515511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2381965520.
The product of its (nonzero) digits is 8000, while the sum is 31.
Adding to 102424515511 its reverse (115515424201), we get a palindrome (217939939712).
The spelling of 102424515511 in words is "one hundred two billion, four hundred twenty-four million, five hundred fifteen thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •