Base | Representation |
---|---|
bin | 10000100110100101000… |
… | …010001000000111111000 |
3 | 11001001221201201220200102 |
4 | 100212211002020013320 |
5 | 122143113343203030 |
6 | 2232045515254532 |
7 | 145300302414443 |
oct | 20464502100770 |
9 | 4031851656612 |
10 | 1140935131640 |
11 | 3aa9601572a7 |
12 | 165154a4a448 |
13 | 83788804b65 |
14 | 3d315d3865a |
15 | 1ea29603c45 |
hex | 109a50881f8 |
1140935131640 has 32 divisors (see below), whose sum is σ = 2567216771280. Its totient is φ = 456354012672.
The previous prime is 1140935131627. The next prime is 1140935131669. The reversal of 1140935131640 is 461315390411.
It is a super-2 number, since 2×11409351316402 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1140935131594 and 1140935131603.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 313472 + ... + 1542768.
Almost surely, 21140935131640 is an apocalyptic number.
1140935131640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1140935131640 is an abundant number, since it is smaller than the sum of its proper divisors (1426281639640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1140935131640 is a wasteful number, since it uses less digits than its factorization.
1140935131640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1252511 (or 1252507 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 38.
The spelling of 1140935131640 in words is "one trillion, one hundred forty billion, nine hundred thirty-five million, one hundred thirty-one thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •