Base | Representation |
---|---|
bin | 11001000100000011101101… |
… | …111101100011010001101011 |
3 | 112110021212222112020221220222 |
4 | 121010003231331203101223 |
5 | 103422002101423120021 |
6 | 1030234551133440255 |
7 | 32134566656106632 |
oct | 3104035575432153 |
9 | 473255875227828 |
10 | 110230033020011 |
11 | 32139326a48893 |
12 | 1044339b04008b |
13 | 4967855777198 |
14 | 1d3123a9c4519 |
15 | cb25096346ab |
hex | 6440edf6346b |
110230033020011 has 8 divisors (see below), whose sum is σ = 111885014452800. Its totient is φ = 108575338559688.
The previous prime is 110230033020007. The next prime is 110230033020047. The reversal of 110230033020011 is 110020330032011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110230033020011 - 22 = 110230033020007 is a prime.
It is a super-2 number, since 2×1102300330200112 (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 (110230033020001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 70969061 + ... + 72505638.
It is an arithmetic number, because the mean of its divisors is an integer number (13985626806600).
Almost surely, 2110230033020011 is an apocalyptic number.
110230033020011 is a deficient number, since it is larger than the sum of its proper divisors (1654981432789).
110230033020011 is a wasteful number, since it uses less digits than its factorization.
110230033020011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143486233.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 110230033020011 its reverse (110020330032011), we get a palindrome (220250363052022).
The spelling of 110230033020011 in words is "one hundred ten trillion, two hundred thirty billion, thirty-three million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •