Base | Representation |
---|---|
bin | 10000101111100110010… |
… | …111101100001011000101 |
3 | 11001222221202212002121211 |
4 | 100233212113230023011 |
5 | 122322433014103312 |
6 | 2240331010211421 |
7 | 146062316102452 |
oct | 20574627541305 |
9 | 4058852762554 |
10 | 1150621237957 |
11 | 403a80768344 |
12 | 166bb8883b71 |
13 | 8467046b609 |
14 | 3d99450c829 |
15 | 1ede4b5b3a7 |
hex | 10be65ec2c5 |
1150621237957 has 2 divisors, whose sum is σ = 1150621237958. Its totient is φ = 1150621237956.
The previous prime is 1150621237951. The next prime is 1150621237967. The reversal of 1150621237957 is 7597321260511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1132977163396 + 17644074561 = 1064414^2 + 132831^2 .
It is an emirp because it is prime and its reverse (7597321260511) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1150621237957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1150621237957.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1150621237951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 575310618978 + 575310618979.
It is an arithmetic number, because the mean of its divisors is an integer number (575310618979).
Almost surely, 21150621237957 is an apocalyptic number.
It is an amenable number.
1150621237957 is a deficient number, since it is larger than the sum of its proper divisors (1).
1150621237957 is an equidigital number, since it uses as much as digits as its factorization.
1150621237957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 793800, while the sum is 49.
The spelling of 1150621237957 in words is "one trillion, one hundred fifty billion, six hundred twenty-one million, two hundred thirty-seven thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •