Base | Representation |
---|---|
bin | 100101110101011101101… |
… | …0100011101011100100001 |
3 | 200102010020122101010222221 |
4 | 1023222323110131130201 |
5 | 1140144202100143131 |
6 | 15020512121231041 |
7 | 1044456110214136 |
oct | 113527324353441 |
9 | 20363218333887 |
10 | 5200053131041 |
11 | 172536a47790a |
12 | 6bb97b332481 |
13 | 2b94943c6a12 |
14 | 13d98093858d |
15 | 903ea68d411 |
hex | 4babb51d721 |
5200053131041 has 16 divisors (see below), whose sum is σ = 5437184572800. Its totient is φ = 4963844096640.
The previous prime is 5200053131027. The next prime is 5200053131071. The reversal of 5200053131041 is 1401313500025.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 5200053131041 - 241 = 3001029875489 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5200053130997 and 5200053131015.
It is not an unprimeable number, because it can be changed into a prime (5200053131071) by changing a digit.
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, 133579006 + ... + 133617928.
It is an arithmetic number, because the mean of its divisors is an integer number (339824035800).
Almost surely, 25200053131041 is an apocalyptic number.
It is an amenable number.
5200053131041 is a deficient number, since it is larger than the sum of its proper divisors (237131441759).
5200053131041 is a wasteful number, since it uses less digits than its factorization.
5200053131041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50616.
The product of its (nonzero) digits is 1800, while the sum is 25.
Adding to 5200053131041 its reverse (1401313500025), we get a palindrome (6601366631066).
The spelling of 5200053131041 in words is "five trillion, two hundred billion, fifty-three million, one hundred thirty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •