Base | Representation |
---|---|
bin | 100010000000111… |
… | …0000101001110001 |
3 | 2221112120122220000 |
4 | 1010001300221301 |
5 | 4314133441423 |
6 | 305130140213 |
7 | 40165664364 |
oct | 10401605161 |
9 | 2845518800 |
10 | 1141312113 |
11 | 536271757 |
12 | 27a281669 |
13 | 1525b6816 |
14 | ab8140db |
15 | 6a2e6843 |
hex | 44070a71 |
1141312113 has 20 divisors (see below), whose sum is σ = 1707869988. Its totient is φ = 759559680.
The previous prime is 1141312099. The next prime is 1141312127. The reversal of 1141312113 is 3112131411.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1141312099) and next prime (1141312127).
It can be written as a sum of positive squares in 2 ways, for example, as 668119104 + 473193009 = 25848^2 + 21753^2 .
It is not a de Polignac number, because 1141312113 - 218 = 1141049969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1141313113) 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 19 ways as a sum of consecutive naturals, for example, 36153 + ... + 59913.
Almost surely, 21141312113 is an apocalyptic number.
It is an amenable number.
1141312113 is a deficient number, since it is larger than the sum of its proper divisors (566557875).
1141312113 is an equidigital number, since it uses as much as digits as its factorization.
1141312113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24366 (or 24357 counting only the distinct ones).
The product of its digits is 72, while the sum is 18.
The square root of 1141312113 is about 33783.3111609860. The cubic root of 1141312113 is about 1045.0445599613.
Adding to 1141312113 its reverse (3112131411), we get a palindrome (4253443524).
The spelling of 1141312113 in words is "one billion, one hundred forty-one million, three hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •