Base | Representation |
---|---|
bin | 100010010111100… |
… | …1100001001101101 |
3 | 2222100222201010101 |
4 | 1010233030021231 |
5 | 4330211034404 |
6 | 310233311101 |
7 | 40402135006 |
oct | 10457141155 |
9 | 2870881111 |
10 | 1153221229 |
11 | 541a661a6 |
12 | 282265491 |
13 | 154bc6334 |
14 | ad2341ad |
15 | 6b39a2a4 |
hex | 44bcc26d |
1153221229 has 2 divisors, whose sum is σ = 1153221230. Its totient is φ = 1153221228.
The previous prime is 1153221191. The next prime is 1153221233. The reversal of 1153221229 is 9221223511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 808264900 + 344956329 = 28430^2 + 18573^2 .
It is a cyclic number.
It is not a de Polignac number, because 1153221229 - 217 = 1153090157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1153221197 and 1153221206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1153221239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 576610614 + 576610615.
It is an arithmetic number, because the mean of its divisors is an integer number (576610615).
Almost surely, 21153221229 is an apocalyptic number.
It is an amenable number.
1153221229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1153221229 is an equidigital number, since it uses as much as digits as its factorization.
1153221229 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2160, while the sum is 28.
The square root of 1153221229 is about 33959.1111338327. Note that the first 4 decimals coincide. The cubic root of 1153221229 is about 1048.6668580429. Note that the first 3 decimals are identical.
It can be divided in two parts, 11532 and 21229, that added together give a square (32761 = 1812).
The spelling of 1153221229 in words is "one billion, one hundred fifty-three million, two hundred twenty-one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •