Base | Representation |
---|---|
bin | 100001100101101… |
… | …0100010010011001 |
3 | 2220112201120102220 |
4 | 1003023110102121 |
5 | 4302010241103 |
6 | 303500214253 |
7 | 36633453231 |
oct | 10313242231 |
9 | 2815646386 |
10 | 1127040153 |
11 | 529203a48 |
12 | 27553a389 |
13 | 14c65a685 |
14 | a997acc1 |
15 | 68e27c53 |
hex | 432d4499 |
1127040153 has 8 divisors (see below), whose sum is σ = 1502880000. Its totient is φ = 751280208.
The previous prime is 1127040127. The next prime is 1127040179. The reversal of 1127040153 is 3510407211.
It is an interprime number because it is at equal distance from previous prime (1127040127) and next prime (1127040179).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1127040153 - 214 = 1127023769 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1127040193) 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 7 ways as a sum of consecutive naturals, for example, 33048 + ... + 57846.
It is an arithmetic number, because the mean of its divisors is an integer number (187860000).
Almost surely, 21127040153 is an apocalyptic number.
It is an amenable number.
1127040153 is a deficient number, since it is larger than the sum of its proper divisors (375839847).
1127040153 is a wasteful number, since it uses less digits than its factorization.
1127040153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39951.
The product of its (nonzero) digits is 840, while the sum is 24.
The square root of 1127040153 is about 33571.4186920958. The cubic root of 1127040153 is about 1040.6702265728.
Adding to 1127040153 its reverse (3510407211), we get a palindrome (4637447364).
The spelling of 1127040153 in words is "one billion, one hundred twenty-seven million, forty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •