Base | Representation |
---|---|
bin | 11001000011110010000110… |
… | …001111011100111111101110 |
3 | 112110020002010221221000212002 |
4 | 121003302012033130333232 |
5 | 103421144324412410410 |
6 | 1030222141504212302 |
7 | 32133330056521205 |
oct | 3103620617347756 |
9 | 473202127830762 |
10 | 110211113013230 |
11 | 321312a8109749 |
12 | 1043b79a90a092 |
13 | 4965b2ba669b8 |
14 | 1d30363d1023c |
15 | cb1c9d5eb7a5 |
hex | 643c863dcfee |
110211113013230 has 16 divisors (see below), whose sum is σ = 198490153374864. Its totient is φ = 44059967438400.
The previous prime is 110211113013187. The next prime is 110211113013259. The reversal of 110211113013230 is 32310311112011.
It is a super-2 number, since 2×1102111130132302 (a number of 29 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 7 ways as a sum of consecutive naturals, for example, 3059701952 + ... + 3059737971.
It is an arithmetic number, because the mean of its divisors is an integer number (12405634585929).
Almost surely, 2110211113013230 is an apocalyptic number.
110211113013230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110211113013230 is a deficient number, since it is larger than the sum of its proper divisors (88279040361634).
110211113013230 is a wasteful number, since it uses less digits than its factorization.
110211113013230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6119441731.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 110211113013230 its reverse (32310311112011), we get a palindrome (142521424125241).
The spelling of 110211113013230 in words is "one hundred ten trillion, two hundred eleven billion, one hundred thirteen million, thirteen thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •