Base | Representation |
---|---|
bin | 101000000001001001100… |
… | …0010010110010011001001 |
3 | 201110210112012101020102100 |
4 | 1100002103002112103021 |
5 | 1210103022400132012 |
6 | 15410402051424013 |
7 | 1105235514115236 |
oct | 120022302262311 |
9 | 21423465336370 |
10 | 5500025005257 |
11 | 1830602803862 |
12 | 749b372b5009 |
13 | 30b85b458743 |
14 | 1502ba03878d |
15 | 981056438dc |
hex | 500930964c9 |
5500025005257 has 6 divisors (see below), whose sum is σ = 7944480563162. Its totient is φ = 3666683336832.
The previous prime is 5500025005253. The next prime is 5500025005261. The reversal of 5500025005257 is 7525005200055.
5500025005257 is a `hidden beast` number, since 5 + 50 + 0 + 0 + 2 + 500 + 52 + 57 = 666.
It is an interprime number because it is at equal distance from previous prime (5500025005253) and next prime (5500025005261).
It can be written as a sum of positive squares in only one way, i.e., 4230833496201 + 1269191509056 = 2056899^2 + 1126584^2 .
It is not a de Polignac number, because 5500025005257 - 22 = 5500025005253 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5500025005253) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 305556944728 + ... + 305556944745.
Almost surely, 25500025005257 is an apocalyptic number.
It is an amenable number.
5500025005257 is a deficient number, since it is larger than the sum of its proper divisors (2444455557905).
5500025005257 is a wasteful number, since it uses less digits than its factorization.
5500025005257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 611113889479 (or 611113889476 counting only the distinct ones).
The product of its (nonzero) digits is 87500, while the sum is 36.
The spelling of 5500025005257 in words is "five trillion, five hundred billion, twenty-five million, five thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •