Base | Representation |
---|---|
bin | 100000011000001100111101… |
… | …000001001101000010110001 |
3 | 200200012101000010220000210112 |
4 | 200120030331001031002301 |
5 | 122131043030043042000 |
6 | 1222505543453111105 |
7 | 41665052133150155 |
oct | 4030147501150261 |
9 | 620171003800715 |
10 | 142400664424625 |
11 | 41411867765492 |
12 | 13b7a252488495 |
13 | 615c42c147869 |
14 | 272432c297065 |
15 | 116e27c3a9235 |
hex | 81833d04d0b1 |
142400664424625 has 8 divisors (see below), whose sum is σ = 177716029202088. Its totient is φ = 113920531539600.
The previous prime is 142400664424621. The next prime is 142400664424631. The reversal of 142400664424625 is 526424466004241.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 2003948840881 + 140396715583744 = 1415609^2 + 11848912^2 .
It is not a de Polignac number, because 142400664424625 - 22 = 142400664424621 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142400664424621) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 569602657574 + ... + 569602657823.
It is an arithmetic number, because the mean of its divisors is an integer number (22214503650261).
Almost surely, 2142400664424625 is an apocalyptic number.
It is an amenable number.
142400664424625 is a deficient number, since it is larger than the sum of its proper divisors (35315364777463).
142400664424625 is an equidigital number, since it uses as much as digits as its factorization.
142400664424625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1139205315412 (or 1139205315402 counting only the distinct ones).
The product of its (nonzero) digits is 8847360, while the sum is 50.
The spelling of 142400664424625 in words is "one hundred forty-two trillion, four hundred billion, six hundred sixty-four million, four hundred twenty-four thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •