Base | Representation |
---|---|
bin | 100010010010011… |
… | …1110000010111101 |
3 | 2222011221120221011 |
4 | 1010210332002331 |
5 | 4324014321023 |
6 | 310100035221 |
7 | 40340305615 |
oct | 10444760275 |
9 | 2864846834 |
10 | 1150542013 |
11 | 5404a6275 |
12 | 281392b11 |
13 | 1544989ba |
14 | acb37a45 |
15 | 6b01b50d |
hex | 4493e0bd |
1150542013 has 4 divisors (see below), whose sum is σ = 1177298848. Its totient is φ = 1123785180.
The previous prime is 1150541993. The next prime is 1150542037. The reversal of 1150542013 is 3102450511.
It is a happy number.
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, and also an emirpimes, since its reverse is a distinct semiprime: 3102450511 = 19 ⋅163286869.
It is a cyclic number.
It is not a de Polignac number, because 1150542013 - 25 = 1150541981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1150542313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13378353 + ... + 13378438.
It is an arithmetic number, because the mean of its divisors is an integer number (294324712).
Almost surely, 21150542013 is an apocalyptic number.
It is an amenable number.
1150542013 is a deficient number, since it is larger than the sum of its proper divisors (26756835).
1150542013 is an equidigital number, since it uses as much as digits as its factorization.
1150542013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26756834.
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 1150542013 is about 33919.6405199112. The cubic root of 1150542013 is about 1047.8541248143.
Adding to 1150542013 its reverse (3102450511), we get a palindrome (4252992524).
The spelling of 1150542013 in words is "one billion, one hundred fifty million, five hundred forty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •