Base | Representation |
---|---|
bin | 10001111100010110010… |
… | …100111011101111010001 |
3 | 11100212122222212010200022 |
4 | 101330112110323233101 |
5 | 130200221212402043 |
6 | 2342240220233225 |
7 | 155040431526014 |
oct | 21742624735721 |
9 | 4325588763608 |
10 | 1233030200273 |
11 | 435a1a448473 |
12 | 17ab7739b815 |
13 | 8c3746a9501 |
14 | 4397119b37b |
15 | 22119871868 |
hex | 11f1653bbd1 |
1233030200273 has 2 divisors, whose sum is σ = 1233030200274. Its totient is φ = 1233030200272.
The previous prime is 1233030200221. The next prime is 1233030200293. The reversal of 1233030200273 is 3720020303321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1232384176384 + 646023889 = 1110128^2 + 25417^2 .
It is a cyclic number.
It is not a de Polignac number, because 1233030200273 - 26 = 1233030200209 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1233030200293) 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, 616515100136 + 616515100137.
It is an arithmetic number, because the mean of its divisors is an integer number (616515100137).
Almost surely, 21233030200273 is an apocalyptic number.
It is an amenable number.
1233030200273 is a deficient number, since it is larger than the sum of its proper divisors (1).
1233030200273 is an equidigital number, since it uses as much as digits as its factorization.
1233030200273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 26.
Adding to 1233030200273 its reverse (3720020303321), we get a palindrome (4953050503594).
The spelling of 1233030200273 in words is "one trillion, two hundred thirty-three billion, thirty million, two hundred thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •