Base | Representation |
---|---|
bin | 11001000010001011101010… |
… | …001010010100101010111010 |
3 | 112102211120020101010020011210 |
4 | 121002023222022110222322 |
5 | 103412344043240142224 |
6 | 1030055431213303550 |
7 | 32122354253421030 |
oct | 3102135212245272 |
9 | 472746211106153 |
10 | 110101120240314 |
11 | 32099694055435 |
12 | 10422402494bb6 |
13 | 495864cbca498 |
14 | 1d28ccba8c550 |
15 | cadeb1e80429 |
hex | 6422ea294aba |
110101120240314 has 32 divisors (see below), whose sum is σ = 251674595254656. Its totient is φ = 31455601444800.
The previous prime is 110101120240303. The next prime is 110101120240361. The reversal of 110101120240314 is 413042021101011.
It is a super-2 number, since 2×1101011202403142 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 76843417 + ... + 78263100.
It is an arithmetic number, because the mean of its divisors is an integer number (7864831101708).
Almost surely, 2110101120240314 is an apocalyptic number.
110101120240314 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
110101120240314 is an abundant number, since it is smaller than the sum of its proper divisors (141573475014342).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110101120240314 is a wasteful number, since it uses less digits than its factorization.
110101120240314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155123430.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 110101120240314 its reverse (413042021101011), we get a palindrome (523143141341325).
The spelling of 110101120240314 in words is "one hundred ten trillion, one hundred one billion, one hundred twenty million, two hundred forty thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •