Base | Representation |
---|---|
bin | 100101010110010111100… |
… | …0100001101011011010001 |
3 | 200011201212210120121220001 |
4 | 1022230233010031123101 |
5 | 1133100422020121231 |
6 | 14530105542050001 |
7 | 1036603232154142 |
oct | 112545704153321 |
9 | 20151783517801 |
10 | 5133275551441 |
11 | 16aa0122519a4 |
12 | 6aaa43719901 |
13 | 2b30b176abcb |
14 | 13a647ca5ac9 |
15 | 8d7dce08b61 |
hex | 4ab2f10d6d1 |
5133275551441 has 2 divisors, whose sum is σ = 5133275551442. Its totient is φ = 5133275551440.
The previous prime is 5133275551387. The next prime is 5133275551463. The reversal of 5133275551441 is 1441555723315.
5133275551441 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4856752070416 + 276523481025 = 2203804^2 + 525855^2 .
It is a cyclic number.
It is not a de Polignac number, because 5133275551441 - 211 = 5133275549393 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5133275551391 and 5133275551400.
It is not a weakly prime, because it can be changed into another prime (5133275551741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2566637775720 + 2566637775721.
It is an arithmetic number, because the mean of its divisors is an integer number (2566637775721).
Almost surely, 25133275551441 is an apocalyptic number.
It is an amenable number.
5133275551441 is a deficient number, since it is larger than the sum of its proper divisors (1).
5133275551441 is an equidigital number, since it uses as much as digits as its factorization.
5133275551441 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1260000, while the sum is 46.
The spelling of 5133275551441 in words is "five trillion, one hundred thirty-three billion, two hundred seventy-five million, five hundred fifty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •