Base | Representation |
---|---|
bin | 100010010101010… |
… | …1010011001011101 |
3 | 2222021202102002122 |
4 | 1010222222121131 |
5 | 4324410100042 |
6 | 310152032325 |
7 | 40356062603 |
oct | 10452523135 |
9 | 2867672078 |
10 | 1152034397 |
11 | 541325548 |
12 | 2819926a5 |
13 | 15489c077 |
14 | ad005873 |
15 | 6b2137d2 |
hex | 44aaa65d |
1152034397 has 2 divisors, whose sum is σ = 1152034398. Its totient is φ = 1152034396.
The previous prime is 1152034379. The next prime is 1152034409. The reversal of 1152034397 is 7934302511.
Together with previous prime (1152034379) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1129699321 + 22335076 = 33611^2 + 4726^2 .
It is a cyclic number.
It is not a de Polignac number, because 1152034397 - 26 = 1152034333 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1152034337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 576017198 + 576017199.
It is an arithmetic number, because the mean of its divisors is an integer number (576017199).
Almost surely, 21152034397 is an apocalyptic number.
It is an amenable number.
1152034397 is a deficient number, since it is larger than the sum of its proper divisors (1).
1152034397 is an equidigital number, since it uses as much as digits as its factorization.
1152034397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22680, while the sum is 35.
The square root of 1152034397 is about 33941.6322088376. The cubic root of 1152034397 is about 1048.3069911031.
The spelling of 1152034397 in words is "one billion, one hundred fifty-two million, thirty-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •