Base | Representation |
---|---|
bin | 100000011001000101010111… |
… | …011001111101000010010001 |
3 | 200200102011100112020112020001 |
4 | 200121011113121331002101 |
5 | 122133041103041144132 |
6 | 1222553442202250001 |
7 | 42002325151525501 |
oct | 4031052731750221 |
9 | 620364315215201 |
10 | 142461236662417 |
11 | 41435520159242 |
12 | 13b89b37ab6901 |
13 | 616506330009a |
14 | 2727236b47a01 |
15 | 1170b24e93ce7 |
hex | 81915767d091 |
142461236662417 has 4 divisors (see below), whose sum is σ = 142480569175780. Its totient is φ = 142441904149056.
The previous prime is 142461236662351. The next prime is 142461236662457. The reversal of 142461236662417 is 714266632164241.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 90006793070481 + 52454443591936 = 9487191^2 + 7242544^2 .
It is a cyclic number.
It is not a de Polignac number, because 142461236662417 - 247 = 1723748307089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142461236662457) 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, 9666245628 + ... + 9666260365.
It is an arithmetic number, because the mean of its divisors is an integer number (35620142293945).
Almost surely, 2142461236662417 is an apocalyptic number.
It is an amenable number.
142461236662417 is a deficient number, since it is larger than the sum of its proper divisors (19332513363).
142461236662417 is an equidigital number, since it uses as much as digits as its factorization.
142461236662417 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19332513362.
The product of its digits is 13934592, while the sum is 55.
The spelling of 142461236662417 in words is "one hundred forty-two trillion, four hundred sixty-one billion, two hundred thirty-six million, six hundred sixty-two thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •