Base | Representation |
---|---|
bin | 1100000010010010000000… |
… | …0000101111001100110111 |
3 | 1201212002112121111212001212 |
4 | 3000210200000233030313 |
5 | 3213303330303200343 |
6 | 44051150344112035 |
7 | 2534035200063503 |
oct | 300444000571467 |
9 | 51762477455055 |
10 | 13233331303223 |
11 | 424225158a389 |
12 | 159885ba6561b |
13 | 74cb89591c05 |
14 | 33a6d4b59303 |
15 | 17e368e1cc18 |
hex | c092002f337 |
13233331303223 has 2 divisors, whose sum is σ = 13233331303224. Its totient is φ = 13233331303222.
The previous prime is 13233331303141. The next prime is 13233331303249. The reversal of 13233331303223 is 32230313333231.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13233331303223 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13233331303223.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13233331303253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6616665651611 + 6616665651612.
It is an arithmetic number, because the mean of its divisors is an integer number (6616665651612).
Almost surely, 213233331303223 is an apocalyptic number.
13233331303223 is a deficient number, since it is larger than the sum of its proper divisors (1).
13233331303223 is an equidigital number, since it uses as much as digits as its factorization.
13233331303223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52488, while the sum is 32.
Adding to 13233331303223 its reverse (32230313333231), we get a palindrome (45463644636454).
The spelling of 13233331303223 in words is "thirteen trillion, two hundred thirty-three billion, three hundred thirty-one million, three hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •