Base | Representation |
---|---|
bin | 1001111010010010… |
… | …1111001100001001 |
3 | 20212102001212200201 |
4 | 2132210233030021 |
5 | 20422032234401 |
6 | 1115554132201 |
7 | 122633200303 |
oct | 23644571411 |
9 | 6772055621 |
10 | 2660430601 |
11 | 114581a984 |
12 | 622b81061 |
13 | 335240bba |
14 | 1b3492973 |
15 | 10886ab01 |
hex | 9e92f309 |
2660430601 has 2 divisors, whose sum is σ = 2660430602. Its totient is φ = 2660430600.
The previous prime is 2660430599. The next prime is 2660430613. The reversal of 2660430601 is 1060340662.
2660430601 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., 2469990601 + 190440000 = 49699^2 + 13800^2 .
It is a cyclic number.
It is not a de Polignac number, because 2660430601 - 21 = 2660430599 is a prime.
Together with 2660430599, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 2660430601.
It is not a weakly prime, because it can be changed into another prime (2660430001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1330215300 + 1330215301.
It is an arithmetic number, because the mean of its divisors is an integer number (1330215301).
Almost surely, 22660430601 is an apocalyptic number.
It is an amenable number.
2660430601 is a deficient number, since it is larger than the sum of its proper divisors (1).
2660430601 is an equidigital number, since it uses as much as digits as its factorization.
2660430601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 28.
The square root of 2660430601 is about 51579.3621616243. The cubic root of 2660430601 is about 1385.6407433770.
The spelling of 2660430601 in words is "two billion, six hundred sixty million, four hundred thirty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •