Base | Representation |
---|---|
bin | 111100010010100… |
… | …111101100011101 |
3 | 2121111100020112201 |
4 | 330102213230131 |
5 | 4032421423031 |
6 | 244212131501 |
7 | 34031504551 |
oct | 7422475435 |
9 | 2544306481 |
10 | 1011514141 |
11 | 479a78600 |
12 | 242906b91 |
13 | 13173bca1 |
14 | 984a7861 |
15 | 5dc07d61 |
hex | 3c4a7b1d |
1011514141 has 6 divisors (see below), whose sum is σ = 1111829726. Its totient is φ = 919558200.
The previous prime is 1011514123. The next prime is 1011514181. The reversal of 1011514141 is 1414151101.
It can be written as a sum of positive squares in only one way, i.e., 1007808516 + 3705625 = 31746^2 + 1925^2 .
It is not a de Polignac number, because 1011514141 - 25 = 1011514109 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 (1011514181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4179690 + ... + 4179931.
Almost surely, 21011514141 is an apocalyptic number.
1011514141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1011514141 is a deficient number, since it is larger than the sum of its proper divisors (100315585).
1011514141 is an equidigital number, since it uses as much as digits as its factorization.
1011514141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8359643 (or 8359632 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 19.
The square root of 1011514141 is about 31804.3101009910. The cubic root of 1011514141 is about 1003.8234099059.
Adding to 1011514141 its reverse (1414151101), we get a palindrome (2425665242).
The spelling of 1011514141 in words is "one billion, eleven million, five hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •