Base | Representation |
---|---|
bin | 100010010010000… |
… | …1011001001001001 |
3 | 2222011112222220221 |
4 | 1010210023021021 |
5 | 4323441133023 |
6 | 310051350041 |
7 | 40335450010 |
oct | 10444131111 |
9 | 2864488827 |
10 | 1150333513 |
11 | 54037365a |
12 | 2812b2321 |
13 | 154424b24 |
14 | acac1a77 |
15 | 6aec985d |
hex | 4490b249 |
1150333513 has 4 divisors (see below), whose sum is σ = 1314666880. Its totient is φ = 986000148.
The previous prime is 1150333493. The next prime is 1150333579. The reversal of 1150333513 is 3153330511.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a de Polignac number, because none of the positive numbers 2k-1150333513 is a prime.
It is a super-2 number, since 2×11503335132 = 2646534382261842338, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1150333013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 82166673 + ... + 82166686.
It is an arithmetic number, because the mean of its divisors is an integer number (328666720).
Almost surely, 21150333513 is an apocalyptic number.
It is an amenable number.
1150333513 is a deficient number, since it is larger than the sum of its proper divisors (164333367).
1150333513 is an equidigital number, since it uses as much as digits as its factorization.
1150333513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164333366.
The product of its (nonzero) digits is 2025, while the sum is 25.
The square root of 1150333513 is about 33916.5669400663. The cubic root of 1150333513 is about 1047.7908239870.
The spelling of 1150333513 in words is "one billion, one hundred fifty million, three hundred thirty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •