Base | Representation |
---|---|
bin | 11001000101000101010010… |
… | …000001000101000111110110 |
3 | 112110112121200200202011102210 |
4 | 121011011102001011013312 |
5 | 103424130240333042124 |
6 | 1030331152445514250 |
7 | 32142641336224131 |
oct | 3105052201050766 |
9 | 473477620664383 |
10 | 110300431143414 |
11 | 32166171943966 |
12 | 10454b67272986 |
13 | 4971394526bc5 |
14 | 1d347d8433218 |
15 | cb4279b87a29 |
hex | 6451520451f6 |
110300431143414 has 32 divisors (see below), whose sum is σ = 220966996110336. Its totient is φ = 36705789563040.
The previous prime is 110300431143389. The next prime is 110300431143451. The reversal of 110300431143414 is 414341134003011.
It is a super-2 number, since 2×1103004311434142 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 442090569 + ... + 442339995.
It is an arithmetic number, because the mean of its divisors is an integer number (6905218628448).
Almost surely, 2110300431143414 is an apocalyptic number.
110300431143414 is an abundant number, since it is smaller than the sum of its proper divisors (110666564966922).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110300431143414 is a wasteful number, since it uses less digits than its factorization.
110300431143414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 371460.
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 110300431143414 its reverse (414341134003011), we get a palindrome (524641565146425).
The spelling of 110300431143414 in words is "one hundred ten trillion, three hundred billion, four hundred thirty-one million, one hundred forty-three thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •