Base | Representation |
---|---|
bin | 101111100011001101… |
… | …1101101110101111000 |
3 | 100202120110101022002110 |
4 | 1133012123231311320 |
5 | 3133112012332412 |
6 | 114524340332320 |
7 | 10243315412022 |
oct | 1370633556570 |
9 | 322513338073 |
10 | 102113402232 |
11 | 3a340398516 |
12 | 179596a40a0 |
13 | 98246108ca |
14 | 4d299d9012 |
15 | 29c9a4cd3c |
hex | 17c66edd78 |
102113402232 has 16 divisors (see below), whose sum is σ = 255283505640. Its totient is φ = 34037800736.
The previous prime is 102113402219. The next prime is 102113402273. The reversal of 102113402232 is 232204311201.
It is a junction number, because it is equal to n+sod(n) for n = 102113402199 and 102113402208.
It is a congruent number.
It is an unprimeable number.
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, 2127362523 + ... + 2127362570.
Almost surely, 2102113402232 is an apocalyptic number.
102113402232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102113402232 is an abundant number, since it is smaller than the sum of its proper divisors (153170103408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102113402232 is a wasteful number, since it uses less digits than its factorization.
102113402232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4254725102 (or 4254725098 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 102113402232 its reverse (232204311201), we get a palindrome (334317713433).
It can be divided in two parts, 1021 and 13402232, that added together give a triangular number (13403253 = T5177).
The spelling of 102113402232 in words is "one hundred two billion, one hundred thirteen million, four hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •