Base | Representation |
---|---|
bin | 101111100110101100… |
… | …1101100100101101000 |
3 | 100202212121100222221202 |
4 | 1133031121230211220 |
5 | 3133331430011240 |
6 | 114544114223332 |
7 | 10246235216462 |
oct | 1371531544550 |
9 | 322777328852 |
10 | 102230313320 |
11 | 3a3a038a553 |
12 | 17990884b48 |
13 | 98428c5875 |
14 | 4d3b34d132 |
15 | 29d4e43315 |
hex | 17cd66c968 |
102230313320 has 64 divisors (see below), whose sum is σ = 233968089600. Its totient is φ = 40195756800.
The previous prime is 102230313299. The next prime is 102230313329. The reversal of 102230313320 is 23313032201.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 102230313292 and 102230313301.
It is not an unprimeable number, because it can be changed into a prime (102230313329) 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, 470537 + ... + 652583.
It is an arithmetic number, because the mean of its divisors is an integer number (3655751400).
Almost surely, 2102230313320 is an apocalyptic number.
102230313320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102230313320 is an abundant number, since it is smaller than the sum of its proper divisors (131737776280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102230313320 is a wasteful number, since it uses less digits than its factorization.
102230313320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 182298 (or 182294 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 102230313320 its reverse (23313032201), we get a palindrome (125543345521).
The spelling of 102230313320 in words is "one hundred two billion, two hundred thirty million, three hundred thirteen thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •