Base | Representation |
---|---|
bin | 1011111011110111110001… |
… | …1001000011110011010001 |
3 | 1201110120022012200100000202 |
4 | 2332331330121003303101 |
5 | 3210002314240030413 |
6 | 43524415334024545 |
7 | 2523056266532231 |
oct | 276757431036321 |
9 | 51416265610022 |
10 | 13123212033233 |
11 | 41aa583086a35 |
12 | 157b4491a8155 |
13 | 74268a465463 |
14 | 335249ba9cc1 |
15 | 17b571615e58 |
hex | bef7c643cd1 |
13123212033233 has 2 divisors, whose sum is σ = 13123212033234. Its totient is φ = 13123212033232.
The previous prime is 13123212033209. The next prime is 13123212033247. The reversal of 13123212033233 is 33233021232131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8666941697089 + 4456270336144 = 2943967^2 + 2110988^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13123212033233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13123212033196 and 13123212033205.
It is not a weakly prime, because it can be changed into another prime (13123212032233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6561606016616 + 6561606016617.
It is an arithmetic number, because the mean of its divisors is an integer number (6561606016617).
Almost surely, 213123212033233 is an apocalyptic number.
It is an amenable number.
13123212033233 is a deficient number, since it is larger than the sum of its proper divisors (1).
13123212033233 is an equidigital number, since it uses as much as digits as its factorization.
13123212033233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 13123212033233 its reverse (33233021232131), we get a palindrome (46356233265364).
The spelling of 13123212033233 in words is "thirteen trillion, one hundred twenty-three billion, two hundred twelve million, thirty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •