Base | Representation |
---|---|
bin | 1001100011101101111100… |
… | …1101010101101110001001 |
3 | 1101012200011122101112100021 |
4 | 2120323133031111232021 |
5 | 2334140403103301100 |
6 | 34203513102340441 |
7 | 2133160431043222 |
oct | 230733715255611 |
9 | 41180148345307 |
10 | 10509234822025 |
11 | 3391a3a099a35 |
12 | 121891558a721 |
13 | 5b302a5b3614 |
14 | 284914a12249 |
15 | 133581689a1a |
hex | 98edf355b89 |
10509234822025 has 27 divisors (see below), whose sum is σ = 13230220606869. Its totient is φ = 8281048622880.
The previous prime is 10509234822011. The next prime is 10509234822071. The reversal of 10509234822025 is 52022843290501.
The square root of 10509234822025 is 3241795.
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 21274847881 + 10487959974144 = 145859^2 + 3238512^2 .
It is not a de Polignac number, because 10509234822025 - 211 = 10509234819977 is a prime.
It is a super-2 number, since 2×105092348220252 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1085996487 + ... + 1086006163.
Almost surely, 210509234822025 is an apocalyptic number.
10509234822025 is the 3241795-th square number.
10509234822025 is the 1620898-th centered octagonal number.
It is an amenable number.
10509234822025 is a deficient number, since it is larger than the sum of its proper divisors (2720985784844).
10509234822025 is an frugal number, since it uses more digits than its factorization.
10509234822025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19498 (or 9749 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 43.
The spelling of 10509234822025 in words is "ten trillion, five hundred nine billion, two hundred thirty-four million, eight hundred twenty-two thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •