Base | Representation |
---|---|
bin | 10010111110011101111… |
… | …010000001100101001111 |
3 | 11121122220200211022112011 |
4 | 102332131322001211033 |
5 | 132331120211340211 |
6 | 2435021022522051 |
7 | 163132636604563 |
oct | 22763572014517 |
9 | 4548820738464 |
10 | 1304024324431 |
11 | 46304080a754 |
12 | 19088b136327 |
13 | 95c79a846ba |
14 | 47187c316a3 |
15 | 23dc23a2921 |
hex | 12f9de8194f |
1304024324431 has 2 divisors, whose sum is σ = 1304024324432. Its totient is φ = 1304024324430.
The previous prime is 1304024324423. The next prime is 1304024324563. The reversal of 1304024324431 is 1344234204031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1304024324431 - 23 = 1304024324423 is a prime.
It is a super-2 number, since 2×13040243244312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1304024324393 and 1304024324402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1304024324731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 652012162215 + 652012162216.
It is an arithmetic number, because the mean of its divisors is an integer number (652012162216).
Almost surely, 21304024324431 is an apocalyptic number.
1304024324431 is a deficient number, since it is larger than the sum of its proper divisors (1).
1304024324431 is an equidigital number, since it uses as much as digits as its factorization.
1304024324431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 1304024324431 its reverse (1344234204031), we get a palindrome (2648258528462).
The spelling of 1304024324431 in words is "one trillion, three hundred four billion, twenty-four million, three hundred twenty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •