Base | Representation |
---|---|
bin | 1011111011110100110011… |
… | …0100110011100100110001 |
3 | 1201110111020121001001211101 |
4 | 2332331030310303210301 |
5 | 3204444200441003213 |
6 | 43524204225244401 |
7 | 2523030436421053 |
oct | 276751464634461 |
9 | 51414217031741 |
10 | 13122414000433 |
11 | 41aa20366a0a1 |
12 | 157b265a93701 |
13 | 742591020aba |
14 | 3351b1bd38d3 |
15 | 17b52652bbdd |
hex | bef4cd33931 |
13122414000433 has 2 divisors, whose sum is σ = 13122414000434. Its totient is φ = 13122414000432.
The previous prime is 13122414000431. The next prime is 13122414000439. The reversal of 13122414000433 is 33400041422131.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7357070361664 + 5765343638769 = 2712392^2 + 2401113^2 .
It is a cyclic number.
It is not a de Polignac number, because 13122414000433 - 21 = 13122414000431 is a prime.
Together with 13122414000431, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (13122414000431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6561207000216 + 6561207000217.
It is an arithmetic number, because the mean of its divisors is an integer number (6561207000217).
Almost surely, 213122414000433 is an apocalyptic number.
It is an amenable number.
13122414000433 is a deficient number, since it is larger than the sum of its proper divisors (1).
13122414000433 is an equidigital number, since it uses as much as digits as its factorization.
13122414000433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 13122414000433 its reverse (33400041422131), we get a palindrome (46522455422564).
The spelling of 13122414000433 in words is "thirteen trillion, one hundred twenty-two billion, four hundred fourteen million, four hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •