Base | Representation |
---|---|
bin | 10100001111011000010… |
… | …000111110011001001100 |
3 | 11220222011101221101022010 |
4 | 110033120100332121030 |
5 | 140242032101441012 |
6 | 2542545533221220 |
7 | 202326603301266 |
oct | 24173020763114 |
9 | 4828141841263 |
10 | 1390902765132 |
11 | 496973394071 |
12 | 1a5696631810 |
13 | a1213c7086a |
14 | 4b46a322b36 |
15 | 262a9677c3c |
hex | 143d843e64c |
1390902765132 has 24 divisors (see below), whose sum is σ = 3251064480496. Its totient is φ = 462830727168.
The previous prime is 1390902765127. The next prime is 1390902765151. The reversal of 1390902765132 is 2315672090931.
It is a super-2 number, since 2×13909027651322 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 100433773 + ... + 100447620.
Almost surely, 21390902765132 is an apocalyptic number.
1390902765132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1390902765132 is an abundant number, since it is smaller than the sum of its proper divisors (1860161715364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1390902765132 is a wasteful number, since it uses less digits than its factorization.
1390902765132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200881977 (or 200881975 counting only the distinct ones).
The product of its (nonzero) digits is 612360, while the sum is 48.
The spelling of 1390902765132 in words is "one trillion, three hundred ninety billion, nine hundred two million, seven hundred sixty-five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •