Base | Representation |
---|---|
bin | 1000010010100100100… |
… | …0110110011001110101 |
3 | 111121121210002020212121 |
4 | 2010221020312121311 |
5 | 4313141032402423 |
6 | 145232334515541 |
7 | 13201254634345 |
oct | 2045110663165 |
9 | 447553066777 |
10 | 142424106613 |
11 | 55446771338 |
12 | 23729665bb1 |
13 | 10579b6b2c9 |
14 | 6c71564d25 |
15 | 3a8895a45d |
hex | 2129236675 |
142424106613 has 2 divisors, whose sum is σ = 142424106614. Its totient is φ = 142424106612.
The previous prime is 142424106611. The next prime is 142424106637. The reversal of 142424106613 is 316601424241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 142417173924 + 6932689 = 377382^2 + 2633^2 .
It is a cyclic number.
It is not a de Polignac number, because 142424106613 - 21 = 142424106611 is a prime.
It is a super-2 number, since 2×1424241066132 (a number of 23 digits) contains 22 as substring.
Together with 142424106611, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142424106611) 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, 71212053306 + 71212053307.
It is an arithmetic number, because the mean of its divisors is an integer number (71212053307).
Almost surely, 2142424106613 is an apocalyptic number.
It is an amenable number.
142424106613 is a deficient number, since it is larger than the sum of its proper divisors (1).
142424106613 is an equidigital number, since it uses as much as digits as its factorization.
142424106613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 34.
The spelling of 142424106613 in words is "one hundred forty-two billion, four hundred twenty-four million, one hundred six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •