Base | Representation |
---|---|
bin | 11011011000011111… |
… | …11001110001100001 |
3 | 1101221112112200112111 |
4 | 31230033321301201 |
5 | 220101424310032 |
6 | 10430433355321 |
7 | 1030206344341 |
oct | 155417716141 |
9 | 41845480474 |
10 | 14701010017 |
11 | 6264378461 |
12 | 2a23408b41 |
13 | 1503912bc5 |
14 | 9d6634d21 |
15 | 5b0954c47 |
hex | 36c3f9c61 |
14701010017 has 2 divisors, whose sum is σ = 14701010018. Its totient is φ = 14701010016.
The previous prime is 14701010003. The next prime is 14701010021. The reversal of 14701010017 is 71001010741.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11631406801 + 3069603216 = 107849^2 + 55404^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14701010017 is a prime.
It is a super-2 number, since 2×147010100172 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14701010017.
It is not a weakly prime, because it can be changed into another prime (14701010047) 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, 7350505008 + 7350505009.
It is an arithmetic number, because the mean of its divisors is an integer number (7350505009).
Almost surely, 214701010017 is an apocalyptic number.
It is an amenable number.
14701010017 is a deficient number, since it is larger than the sum of its proper divisors (1).
14701010017 is an equidigital number, since it uses as much as digits as its factorization.
14701010017 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.
Adding to 14701010017 its reverse (71001010741), we get a palindrome (85702020758).
The spelling of 14701010017 in words is "fourteen billion, seven hundred one million, ten thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •