Base | Representation |
---|---|
bin | 11111011100111111110… |
… | …111101001000011111001 |
3 | 21122122001110212200121022 |
4 | 133130333313221003321 |
5 | 240403112131204401 |
6 | 4332541334352225 |
7 | 312105333501215 |
oct | 37347767510371 |
9 | 7578043780538 |
10 | 2161440100601 |
11 | 763730651931 |
12 | 2aaa99abb675 |
13 | 128a90c80012 |
14 | 76885753945 |
15 | 3b3560d171b |
hex | 1f73fde90f9 |
2161440100601 has 8 divisors (see below), whose sum is σ = 2164217416200. Its totient is φ = 2158664279680.
The previous prime is 2161440100591. The next prime is 2161440100637. The reversal of 2161440100601 is 1060010441612.
It can be written as a sum of positive squares in 4 ways, for example, as 378544867600 + 1782895233001 = 615260^2 + 1335251^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2161440100601 - 214 = 2161440084217 is a prime.
It is a super-2 number, since 2×21614401006012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2161440109601) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2534885 + ... + 3278493.
It is an arithmetic number, because the mean of its divisors is an integer number (270527177025).
Almost surely, 22161440100601 is an apocalyptic number.
It is an amenable number.
2161440100601 is a deficient number, since it is larger than the sum of its proper divisors (2777315599).
2161440100601 is a wasteful number, since it uses less digits than its factorization.
2161440100601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 747339.
The product of its (nonzero) digits is 1152, while the sum is 26.
The spelling of 2161440100601 in words is "two trillion, one hundred sixty-one billion, four hundred forty million, one hundred thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •