Base | Representation |
---|---|
bin | 100001001111011… |
… | …1010111110011101 |
3 | 2212201211022002102 |
4 | 1002132322332131 |
5 | 4241020332031 |
6 | 302402534445 |
7 | 36432522200 |
oct | 10236727635 |
9 | 2781738072 |
10 | 1115402141 |
11 | 522685157 |
12 | 271667425 |
13 | 14a114389 |
14 | a81cb937 |
15 | 67dc97cb |
hex | 427baf9d |
1115402141 has 24 divisors (see below), whose sum is σ = 1331950464. Its totient is φ = 930998880.
The previous prime is 1115402137. The next prime is 1115402143. The reversal of 1115402141 is 1412045111.
It is not a de Polignac number, because 1115402141 - 22 = 1115402137 is a prime.
It is a super-2 number, since 2×11154021412 = 2488243872294767762, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1115402143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 306056 + ... + 309678.
It is an arithmetic number, because the mean of its divisors is an integer number (55497936).
Almost surely, 21115402141 is an apocalyptic number.
It is an amenable number.
1115402141 is a deficient number, since it is larger than the sum of its proper divisors (216548323).
1115402141 is a wasteful number, since it uses less digits than its factorization.
1115402141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3801 (or 3794 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 20.
The square root of 1115402141 is about 33397.6367577109. The cubic root of 1115402141 is about 1037.0757786815.
Adding to 1115402141 its reverse (1412045111), we get a palindrome (2527447252).
The spelling of 1115402141 in words is "one billion, one hundred fifteen million, four hundred two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •