Base | Representation |
---|---|
bin | 100010000110011… |
… | …0100011111010101 |
3 | 2221202000221222111 |
4 | 1010030310133111 |
5 | 4320404231123 |
6 | 305312231021 |
7 | 40232431222 |
oct | 10414643725 |
9 | 2852027874 |
10 | 1144211413 |
11 | 537971a74 |
12 | 27b23b471 |
13 | 153090397 |
14 | abd6a949 |
15 | 6a6ba90d |
hex | 443347d5 |
1144211413 has 4 divisors (see below), whose sum is σ = 1144822240. Its totient is φ = 1143600588.
The previous prime is 1144211399. The next prime is 1144211423. The reversal of 1144211413 is 3141124411.
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, and also an emirpimes, since its reverse is a distinct semiprime: 3141124411 = 1789 ⋅1755799.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1144211413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1144211423) 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, 302595 + ... + 306352.
It is an arithmetic number, because the mean of its divisors is an integer number (286205560).
Almost surely, 21144211413 is an apocalyptic number.
It is an amenable number.
1144211413 is a deficient number, since it is larger than the sum of its proper divisors (610827).
1144211413 is an equidigital number, since it uses as much as digits as its factorization.
1144211413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 610826.
The product of its digits is 384, while the sum is 22.
The square root of 1144211413 is about 33826.1941843891. The cubic root of 1144211413 is about 1045.9287281727.
Adding to 1144211413 its reverse (3141124411), we get a palindrome (4285335824).
The spelling of 1144211413 in words is "one billion, one hundred forty-four million, two hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •