Base | Representation |
---|---|
bin | 1100010100110001111100… |
… | …0001010011011010011001 |
3 | 1202222110212101212221101012 |
4 | 3011030133001103122121 |
5 | 3234010214404113413 |
6 | 44453150411503305 |
7 | 2566015636434053 |
oct | 305143701233231 |
9 | 52873771787335 |
10 | 13551142254233 |
11 | 4355009585801 |
12 | 162a376157b35 |
13 | 773b373cc48c |
14 | 34bc435568d3 |
15 | 18776a0907a8 |
hex | c531f053699 |
13551142254233 has 2 divisors, whose sum is σ = 13551142254234. Its totient is φ = 13551142254232.
The previous prime is 13551142254173. The next prime is 13551142254271. The reversal of 13551142254233 is 33245224115531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12296222520409 + 1254919733824 = 3506597^2 + 1120232^2 .
It is an emirp because it is prime and its reverse (33245224115531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13551142254233 - 214 = 13551142237849 is a prime.
It is not a weakly prime, because it can be changed into another prime (13551142224233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6775571127116 + 6775571127117.
It is an arithmetic number, because the mean of its divisors is an integer number (6775571127117).
Almost surely, 213551142254233 is an apocalyptic number.
It is an amenable number.
13551142254233 is a deficient number, since it is larger than the sum of its proper divisors (1).
13551142254233 is an equidigital number, since it uses as much as digits as its factorization.
13551142254233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 432000, while the sum is 41.
Adding to 13551142254233 its reverse (33245224115531), we get a palindrome (46796366369764).
The spelling of 13551142254233 in words is "thirteen trillion, five hundred fifty-one billion, one hundred forty-two million, two hundred fifty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •