Base | Representation |
---|---|
bin | 100010011011000… |
… | …1001001010011001 |
3 | 2222111102022111011 |
4 | 1010312021022121 |
5 | 4331142401433 |
6 | 310340333521 |
7 | 40423466125 |
oct | 10466111231 |
9 | 2874368434 |
10 | 1155043993 |
11 | 542aa0714 |
12 | 2829a42a1 |
13 | 1553b3bac |
14 | ad58a585 |
15 | 6b60a3cd |
hex | 44d89299 |
1155043993 has 4 divisors (see below), whose sum is σ = 1155620368. Its totient is φ = 1154467620.
The previous prime is 1155043963. The next prime is 1155044081. The reversal of 1155043993 is 3993405511.
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: 3993405511 = 26821 ⋅148891.
It is a cyclic number.
It is not a de Polignac number, because 1155043993 - 25 = 1155043961 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1155043933) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 285171 + ... + 289192.
It is an arithmetic number, because the mean of its divisors is an integer number (288905092).
Almost surely, 21155043993 is an apocalyptic number.
It is an amenable number.
1155043993 is a deficient number, since it is larger than the sum of its proper divisors (576375).
1155043993 is an equidigital number, since it uses as much as digits as its factorization.
1155043993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576374.
The product of its (nonzero) digits is 72900, while the sum is 40.
The square root of 1155043993 is about 33985.9381656590. The cubic root of 1155043993 is about 1049.2190695211.
The spelling of 1155043993 in words is "one billion, one hundred fifty-five million, forty-three thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •