Base | Representation |
---|---|
bin | 10000001010000011111… |
… | …000100011011111111011 |
3 | 10221010220201001120112010 |
4 | 100022003320203133323 |
5 | 121142410414000011 |
6 | 2210023222421003 |
7 | 143134423002420 |
oct | 20120370433773 |
9 | 3833821046463 |
10 | 1110314203131 |
11 | 398977470511 |
12 | 15b229b91763 |
13 | 809188c7253 |
14 | 3ba4d259d47 |
15 | 1dd362261a6 |
hex | 10283e237fb |
1110314203131 has 16 divisors (see below), whose sum is σ = 1691967513600. Its totient is φ = 634442700288.
The previous prime is 1110314203121. The next prime is 1110314203139. The reversal of 1110314203131 is 1313024130111.
It is not a de Polignac number, because 1110314203131 - 25 = 1110314203099 is a prime.
It is a super-2 number, since 2×11103142031312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1110314203098 and 1110314203107.
It is not an unprimeable number, because it can be changed into a prime (1110314203139) 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, 325926 + ... + 1525403.
It is an arithmetic number, because the mean of its divisors is an integer number (105747969600).
Almost surely, 21110314203131 is an apocalyptic number.
1110314203131 is a deficient number, since it is larger than the sum of its proper divisors (581653310469).
1110314203131 is a wasteful number, since it uses less digits than its factorization.
1110314203131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1879898.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1110314203131 its reverse (1313024130111), we get a palindrome (2423338333242).
The spelling of 1110314203131 in words is "one trillion, one hundred ten billion, three hundred fourteen million, two hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •