Base | Representation |
---|---|
bin | 1000010011001011001… |
… | …0110011101101111001 |
3 | 111122001001220101211221 |
4 | 2010302302303231321 |
5 | 4314004020204401 |
6 | 145300402552041 |
7 | 13205262600130 |
oct | 2046262635571 |
9 | 448031811757 |
10 | 142586100601 |
11 | 5551a15586a |
12 | 23773968621 |
13 | 105a45a9539 |
14 | 6c88c92917 |
15 | 3a97ca87a1 |
hex | 2132cb3b79 |
142586100601 has 4 divisors (see below), whose sum is σ = 162955543552. Its totient is φ = 122216657652.
The previous prime is 142586100521. The next prime is 142586100637. The reversal of 142586100601 is 106001685241.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 142586100601 - 27 = 142586100473 is a prime.
It is a super-2 number, since 2×1425861006012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142586400601) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10184721465 + ... + 10184721478.
It is an arithmetic number, because the mean of its divisors is an integer number (40738885888).
Almost surely, 2142586100601 is an apocalyptic number.
It is an amenable number.
142586100601 is a deficient number, since it is larger than the sum of its proper divisors (20369442951).
142586100601 is an equidigital number, since it uses as much as digits as its factorization.
142586100601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20369442950.
The product of its (nonzero) digits is 11520, while the sum is 34.
Adding to 142586100601 its reverse (106001685241), we get a palindrome (248587785842).
The spelling of 142586100601 in words is "one hundred forty-two billion, five hundred eighty-six million, one hundred thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •