Base | Representation |
---|---|
bin | 100010011011011… |
… | …0101100110101011 |
3 | 2222111202120012011 |
4 | 1010312311212223 |
5 | 4331214213102 |
6 | 310344300351 |
7 | 40425154624 |
oct | 10466654653 |
9 | 2874676164 |
10 | 1155226027 |
11 | 54310545a |
12 | 282a716b7 |
13 | 1554489c7 |
14 | ad5d6a4b |
15 | 6b6442d7 |
hex | 44db59ab |
1155226027 has 4 divisors (see below), whose sum is σ = 1155294360. Its totient is φ = 1155157696.
The previous prime is 1155226021. The next prime is 1155226069. The reversal of 1155226027 is 7206225511.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1155226027 - 219 = 1154701739 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1155226027.
It is not an unprimeable number, because it can be changed into a prime (1155226021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11868 + ... + 49510.
It is an arithmetic number, because the mean of its divisors is an integer number (288823590).
Almost surely, 21155226027 is an apocalyptic number.
1155226027 is a deficient number, since it is larger than the sum of its proper divisors (68333).
1155226027 is an equidigital number, since it uses as much as digits as its factorization.
1155226027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68332.
The product of its (nonzero) digits is 8400, while the sum is 31.
The square root of 1155226027 is about 33988.6161383484. The cubic root of 1155226027 is about 1049.2741853184.
The spelling of 1155226027 in words is "one billion, one hundred fifty-five million, two hundred twenty-six thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •