Base | Representation |
---|---|
bin | 100111111100010… |
… | …0111011110001000 |
3 | 10110101220100010012 |
4 | 1033320213132020 |
5 | 10221100214200 |
6 | 340554011052 |
7 | 45132603332 |
oct | 11770473610 |
9 | 3411810105 |
10 | 1340241800 |
11 | 628593557 |
12 | 314a16a88 |
13 | 1848878b1 |
14 | c9dd8452 |
15 | 7c9dda35 |
hex | 4fe27788 |
1340241800 has 48 divisors (see below), whose sum is σ = 3134799360. Its totient is φ = 532873280.
The previous prime is 1340241781. The next prime is 1340241853. The reversal of 1340241800 is 81420431.
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 11 ways as a sum of consecutive naturals, for example, 13337 + ... + 53463.
It is an arithmetic number, because the mean of its divisors is an integer number (65308320).
Almost surely, 21340241800 is an apocalyptic number.
1340241800 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1340241800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1567399680).
1340241800 is an abundant number, since it is smaller than the sum of its proper divisors (1794557560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1340241800 is a wasteful number, since it uses less digits than its factorization.
1340241800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40310 (or 40301 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 23.
The square root of 1340241800 is about 36609.3130227815. The cubic root of 1340241800 is about 1102.5400804361.
The spelling of 1340241800 in words is "one billion, three hundred forty million, two hundred forty-one thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •