Base | Representation |
---|---|
bin | 100010000110101… |
… | …1011001100010001 |
3 | 2221202100000102202 |
4 | 1010031123030101 |
5 | 4320424314222 |
6 | 305315452545 |
7 | 40233661334 |
oct | 10415331421 |
9 | 2852300382 |
10 | 1144369937 |
11 | 537a70087 |
12 | 27b2b7155 |
13 | 153117599 |
14 | abdac61b |
15 | 6a6ec892 |
hex | 4435b311 |
1144369937 has 4 divisors (see below), whose sum is σ = 1146026736. Its totient is φ = 1142713140.
The previous prime is 1144369927. The next prime is 1144369951. The reversal of 1144369937 is 7399634411.
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.
It is a cyclic number.
It is not a de Polignac number, because 1144369937 - 216 = 1144304401 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1144369891 and 1144369900.
It is not an unprimeable number, because it can be changed into a prime (1144369927) 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, 827363 + ... + 828744.
It is an arithmetic number, because the mean of its divisors is an integer number (286506684).
Almost surely, 21144369937 is an apocalyptic number.
It is an amenable number.
1144369937 is a deficient number, since it is larger than the sum of its proper divisors (1656799).
1144369937 is an equidigital number, since it uses as much as digits as its factorization.
1144369937 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1656798.
The product of its digits is 489888, while the sum is 47.
The square root of 1144369937 is about 33828.5373168868. The cubic root of 1144369937 is about 1045.9770284394.
The spelling of 1144369937 in words is "one billion, one hundred forty-four million, three hundred sixty-nine thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •