Base | Representation |
---|---|
bin | 1101101101010100110… |
… | …00100110001110100001 |
3 | 1200000202111102122010211 |
4 | 12312222120212032201 |
5 | 30204112030310032 |
6 | 1000213511054121 |
7 | 46013032012201 |
oct | 6665230461641 |
9 | 1600674378124 |
10 | 471010010017 |
11 | 171832964998 |
12 | 77350371341 |
13 | 355540b9151 |
14 | 18b22db0401 |
15 | c3baa16747 |
hex | 6daa6263a1 |
471010010017 has 2 divisors, whose sum is σ = 471010010018. Its totient is φ = 471010010016.
The previous prime is 471010010011. The next prime is 471010010071. The reversal of 471010010017 is 710010010174.
Together with next prime (471010010071) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 457908002721 + 13102007296 = 676689^2 + 114464^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-471010010017 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 471010010017.
It is not a weakly prime, because it can be changed into another prime (471010010011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 235505005008 + 235505005009.
It is an arithmetic number, because the mean of its divisors is an integer number (235505005009).
Almost surely, 2471010010017 is an apocalyptic number.
It is an amenable number.
471010010017 is a deficient number, since it is larger than the sum of its proper divisors (1).
471010010017 is an equidigital number, since it uses as much as digits as its factorization.
471010010017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 196, while the sum is 22.
The spelling of 471010010017 in words is "four hundred seventy-one billion, ten million, ten thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •