Base | Representation |
---|---|
bin | 101111100000001010… |
… | …1000101100100100000 |
3 | 100202022022200210011200 |
4 | 1133000111011210200 |
5 | 3132404304013440 |
6 | 114510241441200 |
7 | 10240633126350 |
oct | 1370025054440 |
9 | 322268623150 |
10 | 102011001120 |
11 | 3a298606aa6 |
12 | 1792b340200 |
13 | 9809339232 |
14 | 4d1a180b60 |
15 | 29c0a71c30 |
hex | 17c0545920 |
102011001120 has 144 divisors (see below), whose sum is σ = 397842943680. Its totient is φ = 23316797952.
The previous prime is 102011001089. The next prime is 102011001143. The reversal of 102011001120 is 21100110201.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5049990 + ... + 5070149.
It is an arithmetic number, because the mean of its divisors is an integer number (2762798220).
Almost surely, 2102011001120 is an apocalyptic number.
102011001120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102011001120 is an abundant number, since it is smaller than the sum of its proper divisors (295831942560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102011001120 is a wasteful number, since it uses less digits than its factorization.
102011001120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10120167 (or 10120156 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102011001120 its reverse (21100110201), we get a palindrome (123111111321).
The spelling of 102011001120 in words is "one hundred two billion, eleven million, one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •