Base | Representation |
---|---|
bin | 11001000001001010010111… |
… | …010101010000111101000011 |
3 | 112102120212021100110001111121 |
4 | 121001022113111100331003 |
5 | 103410222002321414021 |
6 | 1030003314303453111 |
7 | 32114323012644106 |
oct | 3101122725207503 |
9 | 472525240401447 |
10 | 110031011123011 |
11 | 32071987304980 |
12 | 104108b6bb7197 |
13 | 4951b58c994a4 |
14 | 1d2575a79073d |
15 | cac25beb8741 |
hex | 641297550f43 |
110031011123011 has 16 divisors (see below), whose sum is σ = 123908166604800. Its totient is φ = 96799696963200.
The previous prime is 110031011123003. The next prime is 110031011123023. The reversal of 110031011123011 is 110321110130011.
It is not a de Polignac number, because 110031011123011 - 23 = 110031011123003 is a prime.
It is a super-2 number, since 2×1100310111230112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110031011123041) 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, 15789675 + ... + 21665083.
It is an arithmetic number, because the mean of its divisors is an integer number (7744260412800).
Almost surely, 2110031011123011 is an apocalyptic number.
110031011123011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110031011123011 is a deficient number, since it is larger than the sum of its proper divisors (13877155481789).
110031011123011 is a wasteful number, since it uses less digits than its factorization.
110031011123011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5930370.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 110031011123011 its reverse (110321110130011), we get a palindrome (220352121253022).
The spelling of 110031011123011 in words is "one hundred ten trillion, thirty-one billion, eleven million, one hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •