Base | Representation |
---|---|
bin | 1000010001000010000… |
… | …1011010011111101101 |
3 | 111120112222222010120111 |
4 | 2010100201122133231 |
5 | 4311314321144001 |
6 | 145123343020021 |
7 | 13155111364543 |
oct | 2042041323755 |
9 | 446488863514 |
10 | 142011115501 |
11 | 55254632a72 |
12 | 2363329a611 |
13 | 1051242b878 |
14 | 6c3277bd93 |
15 | 3a6257c851 |
hex | 211085a7ed |
142011115501 has 2 divisors, whose sum is σ = 142011115502. Its totient is φ = 142011115500.
The previous prime is 142011115417. The next prime is 142011115511. The reversal of 142011115501 is 105511110241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 141037051401 + 974064100 = 375549^2 + 31210^2 .
It is an emirp because it is prime and its reverse (105511110241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 142011115501 - 229 = 141474244589 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142011115511) 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 as a sum of consecutive naturals, namely, 71005557750 + 71005557751.
It is an arithmetic number, because the mean of its divisors is an integer number (71005557751).
Almost surely, 2142011115501 is an apocalyptic number.
It is an amenable number.
142011115501 is a deficient number, since it is larger than the sum of its proper divisors (1).
142011115501 is an equidigital number, since it uses as much as digits as its factorization.
142011115501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 200, while the sum is 22.
Adding to 142011115501 its reverse (105511110241), we get a palindrome (247522225742).
The spelling of 142011115501 in words is "one hundred forty-two billion, eleven million, one hundred fifteen thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •