Base | Representation |
---|---|
bin | 10010111110011111011… |
… | …100111000110000000001 |
3 | 11121122222111120222201001 |
4 | 102332133130320300001 |
5 | 132331143330144023 |
6 | 2435023350212001 |
7 | 163133403103636 |
oct | 22763734706001 |
9 | 4548874528631 |
10 | 1304050240513 |
11 | 4630544008a9 |
12 | 190897954001 |
13 | 95c82259867 |
14 | 4718b45a18d |
15 | 23dc47c16ad |
hex | 12f9f738c01 |
1304050240513 has 4 divisors (see below), whose sum is σ = 1312802255700. Its totient is φ = 1295298225328.
The previous prime is 1304050240499. The next prime is 1304050240529. The reversal of 1304050240513 is 3150420504031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 740239978384 + 563810262129 = 860372^2 + 750873^2 .
It is a cyclic number.
It is not a de Polignac number, because 1304050240513 - 225 = 1304016686081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1304050240313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4376007370 + ... + 4376007667.
It is an arithmetic number, because the mean of its divisors is an integer number (328200563925).
Almost surely, 21304050240513 is an apocalyptic number.
It is an amenable number.
1304050240513 is a deficient number, since it is larger than the sum of its proper divisors (8752015187).
1304050240513 is an equidigital number, since it uses as much as digits as its factorization.
1304050240513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8752015186.
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 1304050240513 its reverse (3150420504031), we get a palindrome (4454470744544).
The spelling of 1304050240513 in words is "one trillion, three hundred four billion, fifty million, two hundred forty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •