Base | Representation |
---|---|
bin | 1000010010011110111… |
… | …1011010101110100001 |
3 | 111121120010222011111122 |
4 | 2010213233122232201 |
5 | 4313114032144213 |
6 | 145230140222025 |
7 | 13200551442101 |
oct | 2044757325641 |
9 | 447503864448 |
10 | 142400662433 |
11 | 55434509387 |
12 | 2372183a915 |
13 | 10575050303 |
14 | 6c6c3c1201 |
15 | 3a86878d08 |
hex | 2127bdaba1 |
142400662433 has 8 divisors (see below), whose sum is σ = 150732842400. Its totient is φ = 134152223328.
The previous prime is 142400662421. The next prime is 142400662441. The reversal of 142400662433 is 334266004241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 142400662433 - 28 = 142400662177 is a prime.
It is a super-2 number, since 2×1424006624332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142400662393 and 142400662402.
It is not an unprimeable number, because it can be changed into a prime (142400632433) 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, 20931716 + ... + 20938517.
It is an arithmetic number, because the mean of its divisors is an integer number (18841605300).
Almost surely, 2142400662433 is an apocalyptic number.
It is an amenable number.
142400662433 is a deficient number, since it is larger than the sum of its proper divisors (8332179967).
142400662433 is a wasteful number, since it uses less digits than its factorization.
142400662433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41870431.
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 142400662433 its reverse (334266004241), we get a palindrome (476666666674).
The spelling of 142400662433 in words is "one hundred forty-two billion, four hundred million, six hundred sixty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •