Base | Representation |
---|---|
bin | 100011110011010010101… |
… | …101011110100000110001 |
3 | 22201012100111112000201022 |
4 | 203303102231132200301 |
5 | 310302101121231004 |
6 | 5122120505345225 |
7 | 342514306416341 |
oct | 43632255364061 |
9 | 8635314460638 |
10 | 2460256430129 |
11 | 869430685a73 |
12 | 338992a98215 |
13 | 14b0027b3ca4 |
14 | 871115b6d21 |
15 | 43ee48cd2be |
hex | 23cd2b5e831 |
2460256430129 has 2 divisors, whose sum is σ = 2460256430130. Its totient is φ = 2460256430128.
The previous prime is 2460256430123. The next prime is 2460256430141. The reversal of 2460256430129 is 9210346520642.
2460256430129 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1764912250000 + 695344180129 = 1328500^2 + 833873^2 .
It is a cyclic number.
It is not a de Polignac number, because 2460256430129 - 220 = 2460255381553 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2460256430129.
It is not a weakly prime, because it can be changed into another prime (2460256430123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1230128215064 + 1230128215065.
It is an arithmetic number, because the mean of its divisors is an integer number (1230128215065).
Almost surely, 22460256430129 is an apocalyptic number.
It is an amenable number.
2460256430129 is a deficient number, since it is larger than the sum of its proper divisors (1).
2460256430129 is an equidigital number, since it uses as much as digits as its factorization.
2460256430129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 622080, while the sum is 44.
The spelling of 2460256430129 in words is "two trillion, four hundred sixty billion, two hundred fifty-six million, four hundred thirty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •