Base | Representation |
---|---|
bin | 1101110010100001101011… |
… | …1010111111101010010001 |
3 | 1222200102221222111202122121 |
4 | 3130220122322333222101 |
5 | 3441402113133240401 |
6 | 52125103230334241 |
7 | 3123252501354214 |
oct | 334503272775221 |
9 | 58612858452577 |
10 | 15161686227601 |
11 | 491604267a471 |
12 | 184a52a05a381 |
13 | 85c982922cc4 |
14 | 3a5b8832777b |
15 | 1b45cc184ca1 |
hex | dca1aebfa91 |
15161686227601 has 9 divisors (see below), whose sum is σ = 15702648107601. Its totient is φ = 14638760434704.
The previous prime is 15161686227587. The next prime is 15161686227641. The reversal of 15161686227601 is 10672268616151.
The square root of 15161686227601 is 3893801.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 3954724845201 + 11206961382400 = 1988649^2 + 3347680^2 .
It is not a de Polignac number, because 15161686227601 - 227 = 15161552009873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (15161686227641) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 112853095 + ... + 112987363.
Almost surely, 215161686227601 is an apocalyptic number.
15161686227601 is the 3893801-st square number.
15161686227601 is the 1946901-st centered octagonal number.
It is an amenable number.
15161686227601 is a deficient number, since it is larger than the sum of its proper divisors (540961880000).
15161686227601 is an frugal number, since it uses more digits than its factorization.
15161686227601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268596 (or 134298 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 52.
The spelling of 15161686227601 in words is "fifteen trillion, one hundred sixty-one billion, six hundred eighty-six million, two hundred twenty-seven thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •