Base | Representation |
---|---|
bin | 100111111100000… |
… | …1010000100111010 |
3 | 10110101200012222000 |
4 | 1033320022010322 |
5 | 10221032341102 |
6 | 340551241430 |
7 | 45131562324 |
oct | 11770120472 |
9 | 3411605860 |
10 | 1340121402 |
11 | 628511054 |
12 | 314979276 |
13 | 184844b59 |
14 | c9da6614 |
15 | 7c9b801c |
hex | 4fe0a13a |
1340121402 has 64 divisors (see below), whose sum is σ = 3061618560. Its totient is φ = 434270592.
The previous prime is 1340121401. The next prime is 1340121421. The reversal of 1340121402 is 2041210431.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (1340121401) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 539788 + ... + 542264.
It is an arithmetic number, because the mean of its divisors is an integer number (47837790).
Almost surely, 21340121402 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1340121402, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1530809280).
1340121402 is an abundant number, since it is smaller than the sum of its proper divisors (1721497158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1340121402 is a wasteful number, since it uses less digits than its factorization.
1340121402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2764 (or 2758 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 1340121402 is about 36607.6686228446. The cubic root of 1340121402 is about 1102.5070646037.
Adding to 1340121402 its reverse (2041210431), we get a palindrome (3381331833).
The spelling of 1340121402 in words is "one billion, three hundred forty million, one hundred twenty-one thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •