Base | Representation |
---|---|
bin | 1111001011000011… |
… | …10000100110110001 |
3 | 210000200202111100112 |
4 | 13211201300212301 |
5 | 113140311041401 |
6 | 3424144431105 |
7 | 405601103612 |
oct | 74541604661 |
9 | 23020674315 |
10 | 8145799601 |
11 | 3500100895 |
12 | 16b4018495 |
13 | 9ca801184 |
14 | 573bbbc09 |
15 | 32a1ea3bb |
hex | 1e58709b1 |
8145799601 has 2 divisors, whose sum is σ = 8145799602. Its totient is φ = 8145799600.
The previous prime is 8145799591. The next prime is 8145799603. The reversal of 8145799601 is 1069975418.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5376408976 + 2769390625 = 73324^2 + 52625^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-8145799601 is a prime.
It is a super-2 number, since 2×81457996012 (a number of 21 digits) contains 22 as substring.
Together with 8145799603, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 8145799601.
It is not a weakly prime, because it can be changed into another prime (8145799603) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4072899800 + 4072899801.
It is an arithmetic number, because the mean of its divisors is an integer number (4072899801).
Almost surely, 28145799601 is an apocalyptic number.
It is an amenable number.
8145799601 is a deficient number, since it is larger than the sum of its proper divisors (1).
8145799601 is an equidigital number, since it uses as much as digits as its factorization.
8145799601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 544320, while the sum is 50.
The square root of 8145799601 is about 90254.0835696646. The cubic root of 8145799601 is about 2012.0768942763.
The spelling of 8145799601 in words is "eight billion, one hundred forty-five million, seven hundred ninety-nine thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •