Base | Representation |
---|---|
bin | 100010000110001… |
… | …0000010010110011 |
3 | 2221201202102121110 |
4 | 1010030100102303 |
5 | 4320340010110 |
6 | 305305124403 |
7 | 40231243044 |
oct | 10414202263 |
9 | 2851672543 |
10 | 1144063155 |
11 | 537880644 |
12 | 27b189703 |
13 | 15303aa61 |
14 | abd2c8cb |
15 | 6a68ba20 |
hex | 443104b3 |
1144063155 has 8 divisors (see below), whose sum is σ = 1830501072. Its totient is φ = 610167008.
The previous prime is 1144063103. The next prime is 1144063157. The reversal of 1144063155 is 5513604411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1144063155 - 27 = 1144063027 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1144063157) 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 7 ways as a sum of consecutive naturals, for example, 38135424 + ... + 38135453.
It is an arithmetic number, because the mean of its divisors is an integer number (228812634).
Almost surely, 21144063155 is an apocalyptic number.
1144063155 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1144063155 is a deficient number, since it is larger than the sum of its proper divisors (686437917).
1144063155 is an equidigital number, since it uses as much as digits as its factorization.
1144063155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76270885.
The product of its (nonzero) digits is 7200, while the sum is 30.
The square root of 1144063155 is about 33824.0026460500. The cubic root of 1144063155 is about 1045.8835517897.
Adding to 1144063155 its reverse (5513604411), we get a palindrome (6657667566).
The spelling of 1144063155 in words is "one billion, one hundred forty-four million, sixty-three thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •