Base | Representation |
---|---|
bin | 11001000101000101001010… |
… | …110110111001000110001001 |
3 | 112110112121101022201212211100 |
4 | 121011011022312321012021 |
5 | 103424130014111012301 |
6 | 1030331132515252013 |
7 | 32142635350260513 |
oct | 3105051266710611 |
9 | 473477338655740 |
10 | 110300311032201 |
11 | 321661100665a4 |
12 | 10454b32baa009 |
13 | 4971375691494 |
14 | 1d347c64c8bb3 |
15 | cb426e35e286 |
hex | 64514adb9189 |
110300311032201 has 48 divisors (see below), whose sum is σ = 160089409392640. Its totient is φ = 73180317996000.
The previous prime is 110300311032187. The next prime is 110300311032217. The reversal of 110300311032201 is 102230113003011.
110300311032201 is a `hidden beast` number, since 1 + 1 + 0 + 30 + 0 + 311 + 0 + 322 + 0 + 1 = 666.
It is not a de Polignac number, because 110300311032201 - 210 = 110300311031177 is a prime.
It is a super-2 number, since 2×1103003110322012 (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 (110300311032251) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9973799610 + ... + 9973810668.
Almost surely, 2110300311032201 is an apocalyptic number.
It is an amenable number.
110300311032201 is a deficient number, since it is larger than the sum of its proper divisors (49789098360439).
110300311032201 is a wasteful number, since it uses less digits than its factorization.
110300311032201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15538 (or 15535 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 110300311032201 its reverse (102230113003011), we get a palindrome (212530424035212).
The spelling of 110300311032201 in words is "one hundred ten trillion, three hundred billion, three hundred eleven million, thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •