Base | Representation |
---|---|
bin | 100010000111001… |
… | …0110100100010001 |
3 | 2221202210101001011 |
4 | 1010032112210101 |
5 | 4321010110022 |
6 | 305325010521 |
7 | 40236023353 |
oct | 10416264421 |
9 | 2852711034 |
10 | 1144613137 |
11 | 538116878 |
12 | 27b3b3a41 |
13 | 1531a11a5 |
14 | ac0330d3 |
15 | 6a749977 |
hex | 44396911 |
1144613137 has 4 divisors (see below), whose sum is σ = 1168966656. Its totient is φ = 1120259620.
The previous prime is 1144613021. The next prime is 1144613161. The reversal of 1144613137 is 7313164411.
It is a happy number.
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 1144613137 - 211 = 1144611089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1144613099 and 1144613108.
It is not an unprimeable number, because it can be changed into a prime (1144613737) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12176689 + ... + 12176782.
It is an arithmetic number, because the mean of its divisors is an integer number (292241664).
Almost surely, 21144613137 is an apocalyptic number.
It is an amenable number.
1144613137 is a deficient number, since it is larger than the sum of its proper divisors (24353519).
1144613137 is an equidigital number, since it uses as much as digits as its factorization.
1144613137 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24353518.
The product of its digits is 6048, while the sum is 31.
The square root of 1144613137 is about 33832.1317241465. The cubic root of 1144613137 is about 1046.0511197471.
Adding to 1144613137 its reverse (7313164411), we get a palindrome (8457777548).
The spelling of 1144613137 in words is "one billion, one hundred forty-four million, six hundred thirteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •