Base | Representation |
---|---|
bin | 100010000110001… |
… | …1011011111111010 |
3 | 2221201211202120021 |
4 | 1010030123133322 |
5 | 4320342442200 |
6 | 305310121054 |
7 | 40231523620 |
oct | 10414333772 |
9 | 2851752507 |
10 | 1144109050 |
11 | 537902077 |
12 | 27b1b018a |
13 | 153055906 |
14 | abd41510 |
15 | 6a69a41a |
hex | 4431b7fa |
1144109050 has 48 divisors (see below), whose sum is σ = 2435379840. Its totient is φ = 391728960.
The previous prime is 1144109003. The next prime is 1144109053. The reversal of 1144109050 is 509014411.
It is a super-3 number, since 3×11441090503 (a number of 28 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (1144109053) 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 23 ways as a sum of consecutive naturals, for example, 319872 + ... + 323428.
It is an arithmetic number, because the mean of its divisors is an integer number (50737080).
Almost surely, 21144109050 is an apocalyptic number.
1144109050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1144109050 is an abundant number, since it is smaller than the sum of its proper divisors (1291270790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1144109050 is a wasteful number, since it uses less digits than its factorization.
1144109050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4495 (or 4490 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 25.
The square root of 1144109050 is about 33824.6810775800. The cubic root of 1144109050 is about 1045.8975370851.
The spelling of 1144109050 in words is "one billion, one hundred forty-four million, one hundred nine thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •