Base | Representation |
---|---|
bin | 10010111110100101000… |
… | …010100100000101001000 |
3 | 11121200020001000122012120 |
4 | 102332211002210011020 |
5 | 132331341331102100 |
6 | 2435040540011240 |
7 | 163135622061060 |
oct | 22764502440510 |
9 | 4550201018176 |
10 | 1304144003400 |
11 | 4630a2322297 |
12 | 190903230b20 |
13 | 95c987c8464 |
14 | 47199aa63a0 |
15 | 23dccb430a0 |
hex | 12fa50a4148 |
1304144003400 has 576 divisors, whose sum is σ = 4839996887040. Its totient is φ = 284268096000.
The previous prime is 1304144003359. The next prime is 1304144003411. The reversal of 1304144003400 is 43004414031.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 656337207 + ... + 656339193.
Almost surely, 21304144003400 is an apocalyptic number.
1304144003400 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 1304144003400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2419998443520).
1304144003400 is an abundant number, since it is smaller than the sum of its proper divisors (3535852883640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1304144003400 is a wasteful number, since it uses less digits than its factorization.
1304144003400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2186 (or 2106 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 1304144003400 its reverse (43004414031), we get a palindrome (1347148417431).
The spelling of 1304144003400 in words is "one trillion, three hundred four billion, one hundred forty-four million, three thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •