Base | Representation |
---|---|
bin | 1001010011000101111111100… |
… | …0000110100001011101011001 |
3 | 10011210201122120202001010202022 |
4 | 2110301133320012201131121 |
5 | 1141230223210444442014 |
6 | 10235334541222544225 |
7 | 254551336242460016 |
oct | 22461377006413531 |
9 | 3153648522033668 |
10 | 654312365234009 |
11 | 17a536352317259 |
12 | 61476153298075 |
13 | 22113511879931 |
14 | b780c5d24a70d |
15 | 509a275d0ea8e |
hex | 25317f81a1759 |
654312365234009 has 2 divisors, whose sum is σ = 654312365234010. Its totient is φ = 654312365234008.
The previous prime is 654312365233987. The next prime is 654312365234107. The reversal of 654312365234009 is 900432563213456.
654312365234009 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., 434460663438400 + 219851701795609 = 20843720^2 + 14827397^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-654312365234009 is a prime.
It is not a weakly prime, because it can be changed into another prime (654312365231009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 327156182617004 + 327156182617005.
It is an arithmetic number, because the mean of its divisors is an integer number (327156182617005).
Almost surely, 2654312365234009 is an apocalyptic number.
It is an amenable number.
654312365234009 is a deficient number, since it is larger than the sum of its proper divisors (1).
654312365234009 is an equidigital number, since it uses as much as digits as its factorization.
654312365234009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13996800, while the sum is 53.
The spelling of 654312365234009 in words is "six hundred fifty-four trillion, three hundred twelve billion, three hundred sixty-five million, two hundred thirty-four thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •