Base | Representation |
---|---|
bin | 10111001101110000001000… |
… | …010100101110011000110000 |
3 | 111101111200012200010120210112 |
4 | 113031300020110232120300 |
5 | 101340302002131223440 |
6 | 1001052050041320452 |
7 | 30335326466330366 |
oct | 2715601024563060 |
9 | 441450180116715 |
10 | 102100102211120 |
11 | 2a594456a54862 |
12 | b54b825796128 |
13 | 44c7cc9425ab0 |
14 | 1b2d95812b636 |
15 | bc0cd0976965 |
hex | 5cdc0852e630 |
102100102211120 has 160 divisors (see below), whose sum is σ = 271534666169088. Its totient is φ = 35369011298304.
The previous prime is 102100102211117. The next prime is 102100102211207. The reversal of 102100102211120 is 21112201001201.
It is a super-2 number, since 2×1021001022111202 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102100102211095 and 102100102211104.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3504104 + ... + 14713223.
Almost surely, 2102100102211120 is an apocalyptic number.
102100102211120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102100102211120 is an abundant number, since it is smaller than the sum of its proper divisors (169434563957968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102100102211120 is a wasteful number, since it uses less digits than its factorization.
102100102211120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18217687 (or 18217681 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 102100102211120 its reverse (21112201001201), we get a palindrome (123212303212321).
The spelling of 102100102211120 in words is "one hundred two trillion, one hundred billion, one hundred two million, two hundred eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •