Base | Representation |
---|---|
bin | 1000010001111110100… |
… | …0101100101111000000 |
3 | 111121012200002201102020 |
4 | 2010133220230233000 |
5 | 4312324224332311 |
6 | 145204441521440 |
7 | 13164310566660 |
oct | 2043750545700 |
9 | 447180081366 |
10 | 142264683456 |
11 | 55374783365 |
12 | 236a41a3280 |
13 | 10552b2028c |
14 | 6c583061a0 |
15 | 3a79968c06 |
hex | 211fa2cbc0 |
142264683456 has 112 divisors (see below), whose sum is σ = 436240488960. Its totient is φ = 40074531840.
The previous prime is 142264683443. The next prime is 142264683601. The reversal of 142264683456 is 654386462241.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (112).
It is a super-3 number, since 3×1422646834563 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 142264683399 and 142264683408.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 650011 + ... + 840858.
Almost surely, 2142264683456 is an apocalyptic number.
142264683456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
142264683456 is an abundant number, since it is smaller than the sum of its proper divisors (293975805504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142264683456 is a wasteful number, since it uses less digits than its factorization.
142264683456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1490962 (or 1490952 counting only the distinct ones).
The product of its digits is 6635520, while the sum is 51.
The spelling of 142264683456 in words is "one hundred forty-two billion, two hundred sixty-four million, six hundred eighty-three thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •