Base | Representation |
---|---|
bin | 101111101001001001… |
… | …0111010011011110111 |
3 | 100210002022212111200001 |
4 | 1133102102322123313 |
5 | 3134013434433421 |
6 | 115000210132131 |
7 | 10251253142005 |
oct | 1372222723367 |
9 | 323068774601 |
10 | 102312421111 |
11 | 3a43277032a |
12 | 179b4281047 |
13 | 9856913464 |
14 | 4d48203a75 |
15 | 29dc261691 |
hex | 17d24ba6f7 |
102312421111 has 16 divisors (see below), whose sum is σ = 111486551040. Its totient is φ = 93534946560.
The previous prime is 102312421103. The next prime is 102312421129. The reversal of 102312421111 is 111124213201.
It is not a de Polignac number, because 102312421111 - 23 = 102312421103 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102312421411) 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 15 ways as a sum of consecutive naturals, for example, 38125 + ... + 453958.
It is an arithmetic number, because the mean of its divisors is an integer number (6967909440).
Almost surely, 2102312421111 is an apocalyptic number.
102312421111 is a deficient number, since it is larger than the sum of its proper divisors (9174129929).
102312421111 is a wasteful number, since it uses less digits than its factorization.
102312421111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 492486.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 102312421111 its reverse (111124213201), we get a palindrome (213436634312).
It can be divided in two parts, 10231 and 2421111, that added together give a palindrome (2431342).
The spelling of 102312421111 in words is "one hundred two billion, three hundred twelve million, four hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •