Base | Representation |
---|---|
bin | 100010010101010… |
… | …1111100001100101 |
3 | 2222021210110220102 |
4 | 1010222233201211 |
5 | 4324411233042 |
6 | 310152313445 |
7 | 40356211043 |
oct | 10452574145 |
9 | 2867713812 |
10 | 1152055397 |
11 | 54133a2a9 |
12 | 2819a2885 |
13 | 1548a87ac |
14 | ad00d393 |
15 | 6b219b32 |
hex | 44aaf865 |
1152055397 has 2 divisors, whose sum is σ = 1152055398. Its totient is φ = 1152055396.
The previous prime is 1152055393. The next prime is 1152055403. The reversal of 1152055397 is 7935502511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1082015236 + 70040161 = 32894^2 + 8369^2 .
It is a cyclic number.
It is not a de Polignac number, because 1152055397 - 22 = 1152055393 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1152055397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1152055391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 576027698 + 576027699.
It is an arithmetic number, because the mean of its divisors is an integer number (576027699).
Almost surely, 21152055397 is an apocalyptic number.
It is an amenable number.
1152055397 is a deficient number, since it is larger than the sum of its proper divisors (1).
1152055397 is an equidigital number, since it uses as much as digits as its factorization.
1152055397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 47250, while the sum is 38.
The square root of 1152055397 is about 33941.9415620262. The cubic root of 1152055397 is about 1048.3133607951.
The spelling of 1152055397 in words is "one billion, one hundred fifty-two million, fifty-five thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •