Base | Representation |
---|---|
bin | 10000000001100000011… |
… | …110000110001011010010 |
3 | 10220021012122121022211020 |
4 | 100001200132012023102 |
5 | 121020103303131010 |
6 | 2201504024100310 |
7 | 142361013450402 |
oct | 20014036061322 |
9 | 3807178538736 |
10 | 1101130130130 |
11 | 394a94285538 |
12 | 1594a6304696 |
13 | 7cab3c78224 |
14 | 3b41b60a802 |
15 | 1d999cd9470 |
hex | 100607862d2 |
1101130130130 has 32 divisors (see below), whose sum is σ = 2653241064768. Its totient is φ = 292464840000.
The previous prime is 1101130130077. The next prime is 1101130130137. The reversal of 1101130130130 is 310310311011.
It is a super-2 number, since 2×11011301301302 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1101130130137) 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, 73108681 + ... + 73123740.
It is an arithmetic number, because the mean of its divisors is an integer number (82913783274).
Almost surely, 21101130130130 is an apocalyptic number.
1101130130130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1101130130130 is an abundant number, since it is smaller than the sum of its proper divisors (1552110934638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101130130130 is a wasteful number, since it uses less digits than its factorization.
1101130130130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146232682.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 1101130130130 its reverse (310310311011), we get a palindrome (1411440441141).
The spelling of 1101130130130 in words is "one trillion, one hundred one billion, one hundred thirty million, one hundred thirty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •