Base | Representation |
---|---|
bin | 111100100011010100010… |
… | …010101101000110001001 |
3 | 112201210111111222101021011 |
4 | 330203110102231012021 |
5 | 1021133403021000000 |
6 | 12503324532043521 |
7 | 606425455356334 |
oct | 74432422550611 |
9 | 15653444871234 |
10 | 4161090015625 |
11 | 136478791a694 |
12 | 5725447635a1 |
13 | 242509b2b5ca |
14 | 10557d91361b |
15 | 7338d4aa2ba |
hex | 3c8d44ad189 |
4161090015625 has 21 divisors (see below), whose sum is σ = 5201614688011. Its totient is φ = 3328668025000.
The previous prime is 4161090015617. The next prime is 4161090015683. The reversal of 4161090015625 is 5265100901614.
It is a happy number.
The square root of 4161090015625 is 2039875.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 3 ways, for example, as 3645514318329 + 515575697296 = 1909323^2 + 718036^2 .
It is not a de Polignac number, because 4161090015625 - 23 = 4161090015617 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 20 ways as a sum of consecutive naturals, for example, 254976216 + ... + 254992534.
Almost surely, 24161090015625 is an apocalyptic number.
4161090015625 is the 2039875-th square number.
4161090015625 is the 1019938-th centered octagonal number.
It is an amenable number.
4161090015625 is a deficient number, since it is larger than the sum of its proper divisors (1040524672386).
4161090015625 is an frugal number, since it uses more digits than its factorization.
4161090015625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32668 (or 16324 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 40.
The spelling of 4161090015625 in words is "four trillion, one hundred sixty-one billion, ninety million, fifteen thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •