Base | Representation |
---|---|
bin | 100010010011010… |
… | …1011011010010101 |
3 | 2222012210100102021 |
4 | 1010212223122111 |
5 | 4324123134343 |
6 | 310113413141 |
7 | 40344152620 |
oct | 10446533225 |
9 | 2865710367 |
10 | 1150989973 |
11 | 540781891 |
12 | 28156a1b1 |
13 | 1545c4873 |
14 | acc12db7 |
15 | 6b0a90ed |
hex | 449ab695 |
1150989973 has 8 divisors (see below), whose sum is σ = 1325459520. Its totient is φ = 979031040.
The previous prime is 1150989949. The next prime is 1150989997. The reversal of 1150989973 is 3799890511.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1150989949) and next prime (1150989997).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1150989973 - 29 = 1150989461 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1150989973.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1150983973) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 626668 + ... + 628501.
It is an arithmetic number, because the mean of its divisors is an integer number (165682440).
Almost surely, 21150989973 is an apocalyptic number.
It is an amenable number.
1150989973 is a deficient number, since it is larger than the sum of its proper divisors (174469547).
1150989973 is a wasteful number, since it uses less digits than its factorization.
1150989973 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1255307.
The product of its (nonzero) digits is 612360, while the sum is 52.
The square root of 1150989973 is about 33926.2431312399. The cubic root of 1150989973 is about 1047.9901000973.
The spelling of 1150989973 in words is "one billion, one hundred fifty million, nine hundred eighty-nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •