Base | Representation |
---|---|
bin | 101111101001101101… |
… | …0100011101010111000 |
3 | 100210010122012200112010 |
4 | 1133103122203222320 |
5 | 3134033241432412 |
6 | 115002120445520 |
7 | 10251601603320 |
oct | 1372332435270 |
9 | 323118180463 |
10 | 102331202232 |
11 | 3a442328916 |
12 | 179ba6198a0 |
13 | 985a78ab4c |
14 | 4d4a8d2280 |
15 | 29ddc2133c |
hex | 17d36a3ab8 |
102331202232 has 64 divisors (see below), whose sum is σ = 295107390720. Its totient is φ = 28964233728.
The previous prime is 102331202209. The next prime is 102331202249. The reversal of 102331202232 is 232202133201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 102331202199 and 102331202208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2828353 + ... + 2864304.
It is an arithmetic number, because the mean of its divisors is an integer number (4611052980).
Almost surely, 2102331202232 is an apocalyptic number.
102331202232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102331202232 is an abundant number, since it is smaller than the sum of its proper divisors (192776188488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102331202232 is a wasteful number, since it uses less digits than its factorization.
102331202232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5692780 (or 5692776 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 102331202232 its reverse (232202133201), we get a palindrome (334533335433).
The spelling of 102331202232 in words is "one hundred two billion, three hundred thirty-one million, two hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •