Base | Representation |
---|---|
bin | 10000000000011110010… |
… | …111100110101101100010 |
3 | 10220011100100211101120020 |
4 | 100000132113212231202 |
5 | 121010320402212010 |
6 | 2201202010254310 |
7 | 142321356230154 |
oct | 20003627465542 |
9 | 3804310741506 |
10 | 1100021132130 |
11 | 394575284968 |
12 | 159236a27396 |
13 | 7c968296aab |
14 | 3b354208ad4 |
15 | 1d932777470 |
hex | 1001e5e6b62 |
1100021132130 has 16 divisors (see below), whose sum is σ = 2640050717184. Its totient is φ = 293338968560.
The previous prime is 1100021132107. The next prime is 1100021132143. The reversal of 1100021132130 is 312311200011.
It is a happy number.
It is a super-3 number, since 3×11000211321303 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18333685506 + ... + 18333685565.
It is an arithmetic number, because the mean of its divisors is an integer number (165003169824).
Almost surely, 21100021132130 is an apocalyptic number.
1100021132130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1100021132130 is an abundant number, since it is smaller than the sum of its proper divisors (1540029585054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100021132130 is a wasteful number, since it uses less digits than its factorization.
1100021132130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36667371081.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1100021132130 its reverse (312311200011), we get a palindrome (1412332332141).
The spelling of 1100021132130 in words is "one trillion, one hundred billion, twenty-one million, one hundred thirty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •