Base | Representation |
---|---|
bin | 101000110010111011011… |
… | …1000000100011100010001 |
3 | 201212000110100211120112221 |
4 | 1101211312320010130101 |
5 | 1213330441220343100 |
6 | 15531441522421041 |
7 | 1116041604566224 |
oct | 121456670043421 |
9 | 21760410746487 |
10 | 5606926731025 |
11 | 187197aa70654 |
12 | 7667b0501781 |
13 | 318966ab2c89 |
14 | 15553b9535bb |
15 | 9acb073401a |
hex | 51976e04711 |
5606926731025 has 9 divisors (see below), whose sum is σ = 6952603827451. Its totient is φ = 4485531913240.
The previous prime is 5606926731013. The next prime is 5606926731061. The reversal of 5606926731025 is 5201376296065.
The square root of 5606926731025 is 2367895.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 2018493623169 + 3588433107856 = 1420737^2 + 1894316^2 .
It is not a de Polignac number, because 5606926731025 - 231 = 5604779247377 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 8 ways as a sum of consecutive naturals, for example, 11602686 + ... + 12076264.
Almost surely, 25606926731025 is an apocalyptic number.
5606926731025 is the 2367895-th square number.
5606926731025 is the 1183948-th centered octagonal number.
It is an amenable number.
5606926731025 is a deficient number, since it is larger than the sum of its proper divisors (1345677096426).
5606926731025 is an frugal number, since it uses more digits than its factorization.
5606926731025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 947168 (or 473584 counting only the distinct ones).
The product of its (nonzero) digits is 4082400, while the sum is 52.
The spelling of 5606926731025 in words is "five trillion, six hundred six billion, nine hundred twenty-six million, seven hundred thirty-one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •