Base | Representation |
---|---|
bin | 100010010010011… |
… | …0101011010000111 |
3 | 2222011212210101201 |
4 | 1010210311122013 |
5 | 4324012203011 |
6 | 310055203331 |
7 | 40340100511 |
oct | 10444653207 |
9 | 2864783351 |
10 | 1150506631 |
11 | 54048172a |
12 | 281376547 |
13 | 154485871 |
14 | acb28bb1 |
15 | 6b010cc1 |
hex | 44935687 |
1150506631 has 2 divisors, whose sum is σ = 1150506632. Its totient is φ = 1150506630.
The previous prime is 1150506613. The next prime is 1150506641. The reversal of 1150506631 is 1366050511.
Together with previous prime (1150506613) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1150506631 - 229 = 613635719 is a prime.
It is a super-2 number, since 2×11505066312 = 2647331015949940322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1150506631.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1150506641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 575253315 + 575253316.
It is an arithmetic number, because the mean of its divisors is an integer number (575253316).
Almost surely, 21150506631 is an apocalyptic number.
1150506631 is a deficient number, since it is larger than the sum of its proper divisors (1).
1150506631 is an equidigital number, since it uses as much as digits as its factorization.
1150506631 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2700, while the sum is 28.
The square root of 1150506631 is about 33919.1189596664. The cubic root of 1150506631 is about 1047.8433833393.
The spelling of 1150506631 in words is "one billion, one hundred fifty million, five hundred six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •