Base | Representation |
---|---|
bin | 100000110110011… |
… | …1100010001000101 |
3 | 2211211011122122102 |
4 | 1001230330101011 |
5 | 4224142101404 |
6 | 301214041445 |
7 | 36213253202 |
oct | 10154742105 |
9 | 2754148572 |
10 | 1102300229 |
11 | 516246528 |
12 | 2691a9285 |
13 | 1474a7974 |
14 | a657aca9 |
15 | 66b8c71e |
hex | 41b3c445 |
1102300229 has 2 divisors, whose sum is σ = 1102300230. Its totient is φ = 1102300228.
The previous prime is 1102300169. The next prime is 1102300253. The reversal of 1102300229 is 9220032011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1088868004 + 13432225 = 32998^2 + 3665^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1102300229 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1102300229.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102300429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551150114 + 551150115.
It is an arithmetic number, because the mean of its divisors is an integer number (551150115).
Almost surely, 21102300229 is an apocalyptic number.
It is an amenable number.
1102300229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102300229 is an equidigital number, since it uses as much as digits as its factorization.
1102300229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 1102300229 is about 33200.9070508623. The cubic root of 1102300229 is about 1032.9991540842. Note that the first 3 decimals are identical.
The spelling of 1102300229 in words is "one billion, one hundred two million, three hundred thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •