Base | Representation |
---|---|
bin | 100100000110001… |
… | …1110110000000001 |
3 | 10010102010220220001 |
4 | 1020030132300001 |
5 | 4440033344413 |
6 | 320104520001 |
7 | 42005203252 |
oct | 11014366001 |
9 | 3112126801 |
10 | 1211231233 |
11 | 571787a53 |
12 | 299780001 |
13 | 163c27594 |
14 | b6c14b29 |
15 | 715084dd |
hex | 4831ec01 |
1211231233 has 2 divisors, whose sum is σ = 1211231234. Its totient is φ = 1211231232.
The previous prime is 1211231213. The next prime is 1211231243. The reversal of 1211231233 is 3321321121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 713584369 + 497646864 = 26713^2 + 22308^2 .
It is a cyclic number.
It is not a de Polignac number, because 1211231233 - 229 = 674360321 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1211231233.
It is not a weakly prime, because it can be changed into another prime (1211231213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605615616 + 605615617.
It is an arithmetic number, because the mean of its divisors is an integer number (605615617).
Almost surely, 21211231233 is an apocalyptic number.
It is an amenable number.
1211231233 is a deficient number, since it is larger than the sum of its proper divisors (1).
1211231233 is an equidigital number, since it uses as much as digits as its factorization.
1211231233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 216, while the sum is 19.
The square root of 1211231233 is about 34802.7474921162. The cubic root of 1211231233 is about 1065.9635480286.
Adding to 1211231233 its reverse (3321321121), we get a palindrome (4532552354).
The spelling of 1211231233 in words is "one billion, two hundred eleven million, two hundred thirty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •