Base | Representation |
---|---|
bin | 101111101001110000… |
… | …1110110001100011000 |
3 | 100210010202210202202110 |
4 | 1133103201312030120 |
5 | 3134034234104422 |
6 | 115002225432320 |
7 | 10251624052356 |
oct | 1372341661430 |
9 | 323122722673 |
10 | 102333113112 |
11 | 3a44341355a |
12 | 179bb19b6a0 |
13 | 985aca9849 |
14 | 4d4ac6c7d6 |
15 | 29dde9c60c |
hex | 17d3876318 |
102333113112 has 64 divisors (see below), whose sum is σ = 257999575680. Its totient is φ = 33823291392.
The previous prime is 102333113111. The next prime is 102333113143. The reversal of 102333113112 is 211311333201.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102333113111) 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 in 15 ways as a sum of consecutive naturals, for example, 1386043 + ... + 1458005.
It is an arithmetic number, because the mean of its divisors is an integer number (4031243370).
Almost surely, 2102333113112 is an apocalyptic number.
102333113112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102333113112 is an abundant number, since it is smaller than the sum of its proper divisors (155666462568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102333113112 is a wasteful number, since it uses less digits than its factorization.
102333113112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72472 (or 72468 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 102333113112 its reverse (211311333201), we get a palindrome (313644446313).
The spelling of 102333113112 in words is "one hundred two billion, three hundred thirty-three million, one hundred thirteen thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •