Base | Representation |
---|---|
bin | 100111111100001… |
… | …1101110010010100 |
3 | 10110101211022201000 |
4 | 1033320131302110 |
5 | 10221042432012 |
6 | 340553103300 |
7 | 45132346563 |
oct | 11770356224 |
9 | 3411738630 |
10 | 1340202132 |
11 | 628566775 |
12 | 3149b7b30 |
13 | 184872819 |
14 | c9dc7bda |
15 | 7c9d1ddc |
hex | 4fe1dc94 |
1340202132 has 24 divisors (see below), whose sum is σ = 3474598400. Its totient is φ = 446734008.
The previous prime is 1340202121. The next prime is 1340202167. The reversal of 1340202132 is 2312020431.
It is a super-2 number, since 2×13402021322 = 3592283509234690848, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6204532 + ... + 6204747.
Almost surely, 21340202132 is an apocalyptic number.
1340202132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1340202132 is an abundant number, since it is smaller than the sum of its proper divisors (2134396268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1340202132 is a wasteful number, since it uses less digits than its factorization.
1340202132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12409292 (or 12409284 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 1340202132 is about 36608.7712440612. The cubic root of 1340202132 is about 1102.5292027991.
Adding to 1340202132 its reverse (2312020431), we get a palindrome (3652222563).
The spelling of 1340202132 in words is "one billion, three hundred forty million, two hundred two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •