Base | Representation |
---|---|
bin | 10010111110110100010… |
… | …011100100101010111001 |
3 | 11121200212212221201211021 |
4 | 102332310103210222321 |
5 | 132332402412324010 |
6 | 2435122205302441 |
7 | 163145152041136 |
oct | 22766423445271 |
9 | 4550785851737 |
10 | 1304400120505 |
11 | 463213953919 |
12 | 190974b64a21 |
13 | 960098a0241 |
14 | 471c1ad558d |
15 | 23de53848da |
hex | 12fb44e4ab9 |
1304400120505 has 8 divisors (see below), whose sum is σ = 1588642535232. Its totient is φ = 1027945169328.
The previous prime is 1304400120421. The next prime is 1304400120509. The reversal of 1304400120505 is 5050210044031.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1304400120505 - 217 = 1304399989433 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1304400120505.
It is not an unprimeable number, because it can be changed into a prime (1304400120509) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1946865517 + ... + 1946866186.
It is an arithmetic number, because the mean of its divisors is an integer number (198580316904).
Almost surely, 21304400120505 is an apocalyptic number.
It is an amenable number.
1304400120505 is a deficient number, since it is larger than the sum of its proper divisors (284242414727).
1304400120505 is an equidigital number, since it uses as much as digits as its factorization.
1304400120505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3893731775.
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 1304400120505 its reverse (5050210044031), we get a palindrome (6354610164536).
The spelling of 1304400120505 in words is "one trillion, three hundred four billion, four hundred million, one hundred twenty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •