Base | Representation |
---|---|
bin | 11001000011100111110101… |
… | …110101011001101010010010 |
3 | 112110012000201110121202200020 |
4 | 121003213311311121222102 |
5 | 103421004301141031010 |
6 | 1030213121024204310 |
7 | 32132460134332326 |
oct | 3103476565315222 |
9 | 473160643552606 |
10 | 110200100330130 |
11 | 321276667a8958 |
12 | 10439626769696 |
13 | 4964a9531b475 |
14 | 1d2d9db49b986 |
15 | cb18568a4470 |
hex | 6439f5d59a92 |
110200100330130 has 16 divisors (see below), whose sum is σ = 264480240792384. Its totient is φ = 29386693421360.
The previous prime is 110200100330107. The next prime is 110200100330323. The reversal of 110200100330130 is 31033001002011.
It is a super-2 number, since 2×1102001003301302 (a number of 29 digits) contains 22 as substring.
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, 1836668338806 + ... + 1836668338865.
It is an arithmetic number, because the mean of its divisors is an integer number (16530015049524).
Almost surely, 2110200100330130 is an apocalyptic number.
110200100330130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110200100330130 is an abundant number, since it is smaller than the sum of its proper divisors (154280140462254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110200100330130 is a wasteful number, since it uses less digits than its factorization.
110200100330130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3673336677681.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 110200100330130 its reverse (31033001002011), we get a palindrome (141233101332141).
The spelling of 110200100330130 in words is "one hundred ten trillion, two hundred billion, one hundred million, three hundred thirty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •