Base | Representation |
---|---|
bin | 1010000000100001000001… |
… | …1010111001111000010001 |
3 | 1102221222012101221000201221 |
4 | 2200020100122321320101 |
5 | 2420242123303410000 |
6 | 35223054233125041 |
7 | 2214003632113054 |
oct | 240102032717021 |
9 | 42858171830657 |
10 | 11003981700625 |
11 | 3562842884591 |
12 | 129878b259781 |
13 | 61a895309424 |
14 | 2a084a2c4a9b |
15 | 14138b01761a |
hex | a02106b9e11 |
11003981700625 has 15 divisors (see below), whose sum is σ = 13750679163991. Its totient is φ = 8803119016000.
The previous prime is 11003981700619. The next prime is 11003981700707. The reversal of 11003981700625 is 52600718930011.
The square root of 11003981700625 is 3317225.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 7 ways, for example, as 10891960288209 + 112021412416 = 3300297^2 + 334696^2 .
It is not a de Polignac number, because 11003981700625 - 29 = 11003981700113 is a prime.
It is a super-2 number, since 2×110039817006252 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 82864281 + ... + 82996969.
Almost surely, 211003981700625 is an apocalyptic number.
11003981700625 is the 3317225-th square number.
11003981700625 is the 1658613-rd centered octagonal number.
It is an amenable number.
11003981700625 is a deficient number, since it is larger than the sum of its proper divisors (2746697463366).
11003981700625 is an frugal number, since it uses more digits than its factorization.
11003981700625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 265398 (or 132694 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 43.
The spelling of 11003981700625 in words is "eleven trillion, three billion, nine hundred eighty-one million, seven hundred thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •