Base | Representation |
---|---|
bin | 11001000010110000001010… |
… | …000111101101010010100101 |
3 | 112102222022101122200202202210 |
4 | 121002300022013231102211 |
5 | 103414014324122200201 |
6 | 1030125432130154033 |
7 | 32125242404456313 |
oct | 3102601207552245 |
9 | 472868348622683 |
10 | 110140311131301 |
11 | 32104275310940 |
12 | 10429b1b422919 |
13 | 495c25745a9c9 |
14 | 1d2ab689dd0b3 |
15 | cb00078e11d6 |
hex | 642c0a1ed4a5 |
110140311131301 has 16 divisors (see below), whose sum is σ = 169627858855488. Its totient is φ = 62825132908800.
The previous prime is 110140311131219. The next prime is 110140311131339. The reversal of 110140311131301 is 103131113041011.
It is not a de Polignac number, because 110140311131301 - 218 = 110140310869157 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110140311131341) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 98164269610 + ... + 98164270731.
It is an arithmetic number, because the mean of its divisors is an integer number (10601741178468).
Almost surely, 2110140311131301 is an apocalyptic number.
110140311131301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110140311131301 is a deficient number, since it is larger than the sum of its proper divisors (59487547724187).
110140311131301 is a wasteful number, since it uses less digits than its factorization.
110140311131301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 196328540372.
The product of its (nonzero) digits is 108, while the sum is 21.
Adding to 110140311131301 its reverse (103131113041011), we get a palindrome (213271424172312).
The spelling of 110140311131301 in words is "one hundred ten trillion, one hundred forty billion, three hundred eleven million, one hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •