Base | Representation |
---|---|
bin | 100010000000010110011… |
… | …0001001011001110110001 |
3 | 121112210120111000021111101 |
4 | 1010000230301023032301 |
5 | 1103033141412202414 |
6 | 13535020142044401 |
7 | 661443015222364 |
oct | 104005461131661 |
9 | 17483514007441 |
10 | 4673675506609 |
11 | 1542104a877aa |
12 | 635958579701 |
13 | 27b9584c9765 |
14 | 1222c84020db |
15 | 8188de62a74 |
hex | 4402cc4b3b1 |
4673675506609 has 2 divisors, whose sum is σ = 4673675506610. Its totient is φ = 4673675506608.
The previous prime is 4673675506603. The next prime is 4673675506673. The reversal of 4673675506609 is 9066055763764.
It is an a-pointer prime, because the next prime (4673675506673) can be obtained adding 4673675506609 to its sum of digits (64).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4287810914209 + 385864592400 = 2070703^2 + 621180^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4673675506609 is a prime.
It is not a weakly prime, because it can be changed into another prime (4673675506603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2336837753304 + 2336837753305.
It is an arithmetic number, because the mean of its divisors is an integer number (2336837753305).
Almost surely, 24673675506609 is an apocalyptic number.
It is an amenable number.
4673675506609 is a deficient number, since it is larger than the sum of its proper divisors (1).
4673675506609 is an equidigital number, since it uses as much as digits as its factorization.
4673675506609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 171460800, while the sum is 64.
The spelling of 4673675506609 in words is "four trillion, six hundred seventy-three billion, six hundred seventy-five million, five hundred six thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •