Base | Representation |
---|---|
bin | 100100101010011… |
… | …1010111110110001 |
3 | 10011201212201021101 |
4 | 1021110322332301 |
5 | 10004414034413 |
6 | 322023524401 |
7 | 42325464553 |
oct | 11124727661 |
9 | 3151781241 |
10 | 1230221233 |
11 | 58147846a |
12 | 2a3bb9701 |
13 | 167b46077 |
14 | b95594d3 |
15 | 73009edd |
hex | 4953afb1 |
1230221233 has 2 divisors, whose sum is σ = 1230221234. Its totient is φ = 1230221232.
The previous prime is 1230221203. The next prime is 1230221257. The reversal of 1230221233 is 3321220321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 937400689 + 292820544 = 30617^2 + 17112^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1230221233 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1230221233.
It is not a weakly prime, because it can be changed into another prime (1230221203) 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, 615110616 + 615110617.
It is an arithmetic number, because the mean of its divisors is an integer number (615110617).
Almost surely, 21230221233 is an apocalyptic number.
It is an amenable number.
1230221233 is a deficient number, since it is larger than the sum of its proper divisors (1).
1230221233 is an equidigital number, since it uses as much as digits as its factorization.
1230221233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 1230221233 is about 35074.5097328530. The cubic root of 1230221233 is about 1071.5055038253.
Adding to 1230221233 its reverse (3321220321), we get a palindrome (4551441554).
The spelling of 1230221233 in words is "one billion, two hundred thirty million, two hundred twenty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •