Base | Representation |
---|---|
bin | 101111100101110011… |
… | …0001000110001000000 |
3 | 100202210111100221101010 |
4 | 1133023212020301000 |
5 | 3133301201120112 |
6 | 114541113040520 |
7 | 10245416560035 |
oct | 1371346106100 |
9 | 322714327333 |
10 | 102200020032 |
11 | 3a385279780 |
12 | 179826b6140 |
13 | 983954a246 |
14 | 4d3730538c |
15 | 29d245c63c |
hex | 17cb988c40 |
102200020032 has 112 divisors (see below), whose sum is σ = 295689674304. Its totient is φ = 30895872000.
The previous prime is 102200020001. The next prime is 102200020033. The reversal of 102200020032 is 230020002201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (102200020033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 831682 + ... + 946622.
Almost surely, 2102200020032 is an apocalyptic number.
102200020032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102200020032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (147844837152).
102200020032 is an abundant number, since it is smaller than the sum of its proper divisors (193489654272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102200020032 is a wasteful number, since it uses less digits than its factorization.
102200020032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115388 (or 115378 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
Adding to 102200020032 its reverse (230020002201), we get a palindrome (332220022233).
The spelling of 102200020032 in words is "one hundred two billion, two hundred million, twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •