Base | Representation |
---|---|
bin | 100110101001001000010… |
… | …0101110001111111001001 |
3 | 200210201122002122110012222 |
4 | 1031102100211301333021 |
5 | 1144003414340313113 |
6 | 15143501525343425 |
7 | 1055464444024013 |
oct | 115222045617711 |
9 | 20721562573188 |
10 | 5311005401033 |
11 | 1768426100512 |
12 | 719384b67b75 |
13 | 2c6a96c8b997 |
14 | 1450a83a31b3 |
15 | 93241189e08 |
hex | 4d490971fc9 |
5311005401033 has 4 divisors (see below), whose sum is σ = 5494143518340. Its totient is φ = 5127867283728.
The previous prime is 5311005401027. The next prime is 5311005401071. The reversal of 5311005401033 is 3301045001135.
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 2948061528064 + 2362943872969 = 1716992^2 + 1537187^2 .
It is a cyclic number.
It is not a de Polignac number, because 5311005401033 - 222 = 5311001206729 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5311005400993 and 5311005401011.
It is not an unprimeable number, because it can be changed into a prime (5311005407033) 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, 91569058610 + ... + 91569058667.
It is an arithmetic number, because the mean of its divisors is an integer number (1373535879585).
Almost surely, 25311005401033 is an apocalyptic number.
It is an amenable number.
5311005401033 is a deficient number, since it is larger than the sum of its proper divisors (183138117307).
5311005401033 is a wasteful number, since it uses less digits than its factorization.
5311005401033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183138117306.
The product of its (nonzero) digits is 2700, while the sum is 26.
The spelling of 5311005401033 in words is "five trillion, three hundred eleven billion, five million, four hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •