Base | Representation |
---|---|
bin | 1011001000000100101101… |
… | …1110110100110111000111 |
3 | 1121022111101000201101001201 |
4 | 2302001023132310313013 |
5 | 3100412331301343142 |
6 | 42003525443003331 |
7 | 2401554254524105 |
oct | 262011336646707 |
9 | 47274330641051 |
10 | 12233333231047 |
11 | 3997144760935 |
12 | 1456a9a669547 |
13 | 6a97a181c9c6 |
14 | 30414ca94c75 |
15 | 16333c937ab7 |
hex | b204b7b4dc7 |
12233333231047 has 2 divisors, whose sum is σ = 12233333231048. Its totient is φ = 12233333231046.
The previous prime is 12233333231017. The next prime is 12233333231069. The reversal of 12233333231047 is 74013233333221.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12233333231047 - 235 = 12198973492679 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12233333230997 and 12233333231015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12233333231017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6116666615523 + 6116666615524.
It is an arithmetic number, because the mean of its divisors is an integer number (6116666615524).
Almost surely, 212233333231047 is an apocalyptic number.
12233333231047 is a deficient number, since it is larger than the sum of its proper divisors (1).
12233333231047 is an equidigital number, since it uses as much as digits as its factorization.
12233333231047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 163296, while the sum is 37.
Adding to 12233333231047 its reverse (74013233333221), we get a palindrome (86246566564268).
The spelling of 12233333231047 in words is "twelve trillion, two hundred thirty-three billion, three hundred thirty-three million, two hundred thirty-one thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •