Base | Representation |
---|---|
bin | 11001000010001010101000… |
… | …100101101010101010001011 |
3 | 112102211110101201000220212002 |
4 | 121002022220211222222023 |
5 | 103412334320122041021 |
6 | 1030055130113541215 |
7 | 32122315064451626 |
oct | 3102125045525213 |
9 | 472743351026762 |
10 | 110100020112011 |
11 | 3209917a062796 |
12 | 10422155b7480b |
13 | 49585060032a7 |
14 | 1d28c25918dbd |
15 | cade4a5c150b |
hex | 6422a896aa8b |
110100020112011 has 8 divisors (see below), whose sum is σ = 110117028725760. Its totient is φ = 110083012538472.
The previous prime is 110100020111927. The next prime is 110100020112013. The reversal of 110100020112011 is 110211020001011.
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 110100020112011 - 210 = 110100020110987 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110100020111983 and 110100020112001.
It is not an unprimeable number, because it can be changed into a prime (110100020112013) 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, 226513706 + ... + 226999248.
It is an arithmetic number, because the mean of its divisors is an integer number (13764628590720).
Almost surely, 2110100020112011 is an apocalyptic number.
110100020112011 is a deficient number, since it is larger than the sum of its proper divisors (17008613749).
110100020112011 is an equidigital number, since it uses as much as digits as its factorization.
110100020112011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 520105.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110100020112011 its reverse (110211020001011), we get a palindrome (220311040113022).
The spelling of 110100020112011 in words is "one hundred ten trillion, one hundred billion, twenty million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •