Base | Representation |
---|---|
bin | 10001111100011101000… |
… | …011101000001000000001 |
3 | 11100212221212022020110212 |
4 | 101330131003220020001 |
5 | 130200434113312001 |
6 | 2342255332203505 |
7 | 155043302303264 |
oct | 21743503501001 |
9 | 4325855266425 |
10 | 1233143104001 |
11 | 435a78152736 |
12 | 17aba9169595 |
13 | 8c391bba453 |
14 | 4398218acdb |
15 | 221247247bb |
hex | 11f1d0e8201 |
1233143104001 has 2 divisors, whose sum is σ = 1233143104002. Its totient is φ = 1233143104000.
The previous prime is 1233143103991. The next prime is 1233143104003. The reversal of 1233143104001 is 1004013413321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1153370750401 + 79772353600 = 1073951^2 + 282440^2 .
It is a cyclic number.
It is not a de Polignac number, because 1233143104001 - 230 = 1232069362177 is a prime.
It is a super-2 number, since 2×12331431040012 (a number of 25 digits) contains 22 as substring.
Together with 1233143104003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1233143104003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 616571552000 + 616571552001.
It is an arithmetic number, because the mean of its divisors is an integer number (616571552001).
Almost surely, 21233143104001 is an apocalyptic number.
It is an amenable number.
1233143104001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1233143104001 is an equidigital number, since it uses as much as digits as its factorization.
1233143104001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 1233143104001 its reverse (1004013413321), we get a palindrome (2237156517322).
The spelling of 1233143104001 in words is "one trillion, two hundred thirty-three billion, one hundred forty-three million, one hundred four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •