Base | Representation |
---|---|
bin | 101000100111000010000… |
… | …1100000010000100111101 |
3 | 201202120111222122121020221 |
4 | 1101032010030002010331 |
5 | 1212421131321424003 |
6 | 15512014541141341 |
7 | 1114145543320243 |
oct | 121160414020475 |
9 | 21676458577227 |
10 | 5581380264253 |
11 | 186206071aaa2 |
12 | 761860b5a851 |
13 | 3164252a5551 |
14 | 1541d6b9a793 |
15 | 9a2b7aba7bd |
hex | 5138430213d |
5581380264253 has 2 divisors, whose sum is σ = 5581380264254. Its totient is φ = 5581380264252.
The previous prime is 5581380264241. The next prime is 5581380264281. The reversal of 5581380264253 is 3524620831855.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5563928004804 + 17452259449 = 2358798^2 + 132107^2 .
It is a cyclic number.
It is not a de Polignac number, because 5581380264253 - 229 = 5580843393341 is a prime.
It is a super-3 number, since 3×55813802642533 (a number of 39 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5581380264253.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5581380264353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2790690132126 + 2790690132127.
It is an arithmetic number, because the mean of its divisors is an integer number (2790690132127).
Almost surely, 25581380264253 is an apocalyptic number.
It is an amenable number.
5581380264253 is a deficient number, since it is larger than the sum of its proper divisors (1).
5581380264253 is an equidigital number, since it uses as much as digits as its factorization.
5581380264253 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912000, while the sum is 52.
The spelling of 5581380264253 in words is "five trillion, five hundred eighty-one billion, three hundred eighty million, two hundred sixty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •