Base | Representation |
---|---|
bin | 10000001101100111001… |
… | …010110101100110011101 |
3 | 10221111202110022021001000 |
4 | 100031213022311212131 |
5 | 121223213110031101 |
6 | 2211453441140513 |
7 | 143331054564222 |
oct | 20154712654635 |
9 | 3844673267030 |
10 | 1114127423901 |
11 | 39a553981738 |
12 | 15bb1302a739 |
13 | 810a59101bb |
14 | 3bcd186d949 |
15 | 1deaada4486 |
hex | 103672b599d |
1114127423901 has 8 divisors (see below), whose sum is σ = 1650559146560. Its totient is φ = 742751615916.
The previous prime is 1114127423869. The next prime is 1114127423921. The reversal of 1114127423901 is 1093247214111.
1114127423901 is a `hidden beast` number, since 1 + 1 + 1 + 412 + 7 + 4 + 239 + 0 + 1 = 666.
It is not a de Polignac number, because 1114127423901 - 25 = 1114127423869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1114127423921) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20631989305 + ... + 20631989358.
It is an arithmetic number, because the mean of its divisors is an integer number (206319893320).
Almost surely, 21114127423901 is an apocalyptic number.
It is an amenable number.
1114127423901 is a deficient number, since it is larger than the sum of its proper divisors (536431722659).
1114127423901 is an equidigital number, since it uses as much as digits as its factorization.
1114127423901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41263978672 (or 41263978666 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 36.
It can be divided in two parts, 11141274 and 23901, that added together give a triangular number (11165175 = T4725).
The spelling of 1114127423901 in words is "one trillion, one hundred fourteen billion, one hundred twenty-seven million, four hundred twenty-three thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •