Base | Representation |
---|---|
bin | 10110110001000101010101… |
… | …110000011001001100010110 |
3 | 111010112100001122112221112220 |
4 | 112301011111300121030112 |
5 | 101111012230344233420 |
6 | 552543031524323210 |
7 | 30043104011140611 |
oct | 2661052560311426 |
9 | 433470048487486 |
10 | 100130011321110 |
11 | 299a4999008aa1 |
12 | b291a4a243506 |
13 | 43b42b1482754 |
14 | 1aa24659c7178 |
15 | b8992861c840 |
hex | 5b1155c19316 |
100130011321110 has 64 divisors (see below), whose sum is σ = 240440906464704. Its totient is φ = 26687018534400.
The previous prime is 100130011321091. The next prime is 100130011321187. The reversal of 100130011321110 is 11123110031001.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 100130011321110.
It is a congruent number.
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, 860601540 + ... + 860717880.
It is an arithmetic number, because the mean of its divisors is an integer number (3756889163511).
Almost surely, 2100130011321110 is an apocalyptic number.
100130011321110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100130011321110 is an abundant number, since it is smaller than the sum of its proper divisors (140310895143594).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100130011321110 is a wasteful number, since it uses less digits than its factorization.
100130011321110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131489.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 100130011321110 its reverse (11123110031001), we get a palindrome (111253121352111).
The spelling of 100130011321110 in words is "one hundred trillion, one hundred thirty billion, eleven million, three hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •