Base | Representation |
---|---|
bin | 1001111010011110… |
… | …0011110011100001 |
3 | 20212110110110111201 |
4 | 2132213203303201 |
5 | 20422224423101 |
6 | 1120022041201 |
7 | 122642401201 |
oct | 23647436341 |
9 | 6773413451 |
10 | 2661170401 |
11 | 114618578a |
12 | 623279201 |
13 | 33543c856 |
14 | 1b3606401 |
15 | 108964e01 |
hex | 9e9e3ce1 |
2661170401 has 4 divisors (see below), whose sum is σ = 2661278400. Its totient is φ = 2661062404.
The previous prime is 2661170371. The next prime is 2661170483. The reversal of 2661170401 is 1040711662.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 2661170401 - 231 = 513686753 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2661170401.
It is not an unprimeable number, because it can be changed into a prime (2661170801) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3060 + ... + 73018.
It is an arithmetic number, because the mean of its divisors is an integer number (665319600).
Almost surely, 22661170401 is an apocalyptic number.
It is an amenable number.
2661170401 is a deficient number, since it is larger than the sum of its proper divisors (107999).
2661170401 is an equidigital number, since it uses as much as digits as its factorization.
2661170401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107998.
The product of its (nonzero) digits is 2016, while the sum is 28.
The square root of 2661170401 is about 51586.5331360812. The cubic root of 2661170401 is about 1385.7691689557.
The spelling of 2661170401 in words is "two billion, six hundred sixty-one million, one hundred seventy thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •