Base | Representation |
---|---|
bin | 1100001101101111000110… |
… | …1110000001001111000001 |
3 | 1202112220111101001222000101 |
4 | 3003123301232001033001 |
5 | 3230014343010440113 |
6 | 44321414032122401 |
7 | 2554202654101165 |
oct | 303336156011701 |
9 | 52486441058011 |
10 | 13430123140033 |
11 | 4308757432046 |
12 | 160aa21096401 |
13 | 7655bc044a72 |
14 | 346042b28ca5 |
15 | 1845358d02dd |
hex | c36f1b813c1 |
13430123140033 has 2 divisors, whose sum is σ = 13430123140034. Its totient is φ = 13430123140032.
The previous prime is 13430123140013. The next prime is 13430123140037. The reversal of 13430123140033 is 33004132103431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11807587271089 + 1622535868944 = 3436217^2 + 1273788^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13430123140033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13430123139983 and 13430123140010.
It is not a weakly prime, because it can be changed into another prime (13430123140037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6715061570016 + 6715061570017.
It is an arithmetic number, because the mean of its divisors is an integer number (6715061570017).
Almost surely, 213430123140033 is an apocalyptic number.
It is an amenable number.
13430123140033 is a deficient number, since it is larger than the sum of its proper divisors (1).
13430123140033 is an equidigital number, since it uses as much as digits as its factorization.
13430123140033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 13430123140033 its reverse (33004132103431), we get a palindrome (46434255243464).
The spelling of 13430123140033 in words is "thirteen trillion, four hundred thirty billion, one hundred twenty-three million, one hundred forty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •