Base | Representation |
---|---|
bin | 100100101011101010111… |
… | …0000111010001101100001 |
3 | 122211222012120212201200022 |
4 | 1021113111300322031201 |
5 | 1130100130222202221 |
6 | 14420023220403225 |
7 | 1030146061325333 |
oct | 111272560721541 |
9 | 18758176781608 |
10 | 5041583006561 |
11 | 167413a19a892 |
12 | 695113b46515 |
13 | 2a755b0ac7aa |
14 | 13602a2a3453 |
15 | 8b22319c4ab |
hex | 495d5c3a361 |
5041583006561 has 4 divisors (see below), whose sum is σ = 5042003816724. Its totient is φ = 5041162196400.
The previous prime is 5041583006557. The next prime is 5041583006569. The reversal of 5041583006561 is 1656003851405.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3465945507025 + 1575637499536 = 1861705^2 + 1255244^2 .
It is a cyclic number.
It is not a de Polignac number, because 5041583006561 - 22 = 5041583006557 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5041583006569) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 210387110 + ... + 210411071.
It is an arithmetic number, because the mean of its divisors is an integer number (1260500954181).
Almost surely, 25041583006561 is an apocalyptic number.
It is an amenable number.
5041583006561 is a deficient number, since it is larger than the sum of its proper divisors (420810163).
5041583006561 is a wasteful number, since it uses less digits than its factorization.
5041583006561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420810162.
The product of its (nonzero) digits is 432000, while the sum is 44.
Adding to 5041583006561 its reverse (1656003851405), we get a palindrome (6697586857966).
The spelling of 5041583006561 in words is "five trillion, forty-one billion, five hundred eighty-three million, six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •