Base | Representation |
---|---|
bin | 10000001101001111010… |
… | …111100000111000100011 |
3 | 10221110201121220012000201 |
4 | 100031033113200320203 |
5 | 121221403342444411 |
6 | 2211350054130031 |
7 | 143315135412301 |
oct | 20151727407043 |
9 | 3843647805021 |
10 | 1113728093731 |
11 | 39a369524000 |
12 | 15ba21350917 |
13 | 81040c74766 |
14 | 3bc94801271 |
15 | 1de85cc43c1 |
hex | 1034f5e0e23 |
1113728093731 has 64 divisors (see below), whose sum is σ = 1329163960320. Its totient is φ = 930365805600.
The previous prime is 1113728093713. The next prime is 1113728093741. The reversal of 1113728093731 is 1373908273111.
It is not a de Polignac number, because 1113728093731 - 225 = 1113694539299 is a prime.
It is a super-2 number, since 2×11137280937312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1113728093741) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 131907196 + ... + 131915638.
It is an arithmetic number, because the mean of its divisors is an integer number (20768186880).
Almost surely, 21113728093731 is an apocalyptic number.
1113728093731 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1113728093731 is a deficient number, since it is larger than the sum of its proper divisors (215435866589).
1113728093731 is a wasteful number, since it uses less digits than its factorization.
1113728093731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8669 (or 8647 counting only the distinct ones).
The product of its (nonzero) digits is 190512, while the sum is 46.
The spelling of 1113728093731 in words is "one trillion, one hundred thirteen billion, seven hundred twenty-eight million, ninety-three thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •