Base | Representation |
---|---|
bin | 100110010010000100011… |
… | …0110011110111110110101 |
3 | 200121222210211100002001011 |
4 | 1030210020312132332311 |
5 | 1142201004230004010 |
6 | 15105031522032221 |
7 | 1052062315212034 |
oct | 114441066367665 |
9 | 20558724302034 |
10 | 5261483438005 |
11 | 1749423263743 |
12 | 70b8641a8671 |
13 | 2c2204284292 |
14 | 14292b34c71b |
15 | 91ce3770a8a |
hex | 4c908d9efb5 |
5261483438005 has 16 divisors (see below), whose sum is σ = 6708311094960. Its totient is φ = 3961587511296.
The previous prime is 5261483437999. The next prime is 5261483438021. The reversal of 5261483438005 is 5008343841625.
It can be written as a sum of positive squares in 8 ways, for example, as 57965859121 + 5203517578884 = 240761^2 + 2281122^2 .
It is not a de Polignac number, because 5261483438005 - 29 = 5261483437493 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5261483438005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107068524 + ... + 107117653.
It is an arithmetic number, because the mean of its divisors is an integer number (419269443435).
Almost surely, 25261483438005 is an apocalyptic number.
It is an amenable number.
5261483438005 is a deficient number, since it is larger than the sum of its proper divisors (1446827656955).
5261483438005 is an equidigital number, since it uses as much as digits as its factorization.
5261483438005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214186233 (or 214186199 counting only the distinct ones).
The product of its (nonzero) digits is 2764800, while the sum is 49.
The spelling of 5261483438005 in words is "five trillion, two hundred sixty-one billion, four hundred eighty-three million, four hundred thirty-eight thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •