Base | Representation |
---|---|
bin | 1000000111100010000100… |
… | …0100010110000101011001 |
3 | 1011121021021012221120010211 |
4 | 2001320201010112011121 |
5 | 2132213404142000444 |
6 | 30552152221011121 |
7 | 1610563063155061 |
oct | 201704104260531 |
9 | 34537235846124 |
10 | 8925496828249 |
11 | 29313112aa511 |
12 | 10019a29b3aa1 |
13 | 4c98947cac91 |
14 | 22bdd3dba3a1 |
15 | 10728caa2c34 |
hex | 81e21116159 |
8925496828249 has 9 divisors (see below), whose sum is σ = 9097241280253. Its totient is φ = 8756935874752.
The previous prime is 8925496828229. The next prime is 8925496828253. The reversal of 8925496828249 is 9428286945298.
The square root of 8925496828249 is 2987557.
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 778285662025 + 8147211166224 = 882205^2 + 2854332^2 .
It is not a de Polignac number, because 8925496828249 - 231 = 8923349344601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (8925496828219) 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, 158312337 + ... + 158368705.
Almost surely, 28925496828249 is an apocalyptic number.
8925496828249 is the 2987557-th square number.
8925496828249 is the 1493779-th centered octagonal number.
It is an amenable number.
8925496828249 is a deficient number, since it is larger than the sum of its proper divisors (171744452004).
8925496828249 is an frugal number, since it uses more digits than its factorization.
8925496828249 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112844 (or 56422 counting only the distinct ones).
The product of its digits is 1433272320, while the sum is 76.
The spelling of 8925496828249 in words is "eight trillion, nine hundred twenty-five billion, four hundred ninety-six million, eight hundred twenty-eight thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •