Base | Representation |
---|---|
bin | 110011001111001011… |
… | …0111111110111101110 |
3 | 101112000020202111220010 |
4 | 1212132112333313232 |
5 | 3300320414330220 |
6 | 122314134234050 |
7 | 10643446110303 |
oct | 1463626776756 |
9 | 345006674803 |
10 | 110031011310 |
11 | 427337013a0 |
12 | 193a91b5926 |
13 | a4b6a672ac |
14 | 547b3770aa |
15 | 2cdebc11e0 |
hex | 199e5bfdee |
110031011310 has 128 divisors (see below), whose sum is σ = 305272447488. Its totient is φ = 25084928000.
The previous prime is 110031011303. The next prime is 110031011351. The reversal of 110031011310 is 13110130011.
It is a super-2 number, since 2×1100310113102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7628005 + ... + 7642415.
It is an arithmetic number, because the mean of its divisors is an integer number (2384940996).
Almost surely, 2110031011310 is an apocalyptic number.
110031011310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 110031011310, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152636223744).
110031011310 is an abundant number, since it is smaller than the sum of its proper divisors (195241436178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110031011310 is a wasteful number, since it uses less digits than its factorization.
110031011310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15810.
The product of its (nonzero) digits is 9, while the sum is 12.
Adding to 110031011310 its reverse (13110130011), we get a palindrome (123141141321).
The spelling of 110031011310 in words is "one hundred ten billion, thirty-one million, eleven thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •