Base | Representation |
---|---|
bin | 100000011100010101001111… |
… | …101000001110101001100001 |
3 | 200201012111111021010210222222 |
4 | 200130111033220032221201 |
5 | 122200220220242024431 |
6 | 1223244155012440425 |
7 | 42024416355653450 |
oct | 4034251750165141 |
9 | 621174437123888 |
10 | 142684444486241 |
11 | 41511151155a29 |
12 | 1400524b919115 |
13 | 6180115774898 |
14 | 2733d6d174b97 |
15 | 117683aaca57b |
hex | 81c54fa0ea61 |
142684444486241 has 16 divisors (see below), whose sum is σ = 173349969048960. Its totient is φ = 114716891260800.
The previous prime is 142684444486217. The next prime is 142684444486261.
142684444486241 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 142684444486241 - 210 = 142684444485217 is a prime.
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142684444486261) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5310953756 + ... + 5310980621.
It is an arithmetic number, because the mean of its divisors is an integer number (10834373065560).
Almost surely, 2142684444486241 is an apocalyptic number.
It is an amenable number.
142684444486241 is a deficient number, since it is larger than the sum of its proper divisors (30665524562719).
142684444486241 is a wasteful number, since it uses less digits than its factorization.
142684444486241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10621934504.
The product of its digits is 150994944, while the sum is 62.
The spelling of 142684444486241 in words is "one hundred forty-two trillion, six hundred eighty-four billion, four hundred forty-four million, four hundred eighty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •