Base | Representation |
---|---|
bin | 100000011000110001101000… |
… | …110010000001000111110001 |
3 | 200200100010200020002121010000 |
4 | 200120301220302001013301 |
5 | 122132214212124044201 |
6 | 1222540020202300213 |
7 | 42000645210363030 |
oct | 4030615062010761 |
9 | 620303606077100 |
10 | 142440053346801 |
11 | 4142753a789731 |
12 | 13b85a057b7669 |
13 | 61630687231c2 |
14 | 27261c7636717 |
15 | 11702d53d5d86 |
hex | 818c68c811f1 |
142440053346801 has 80 divisors (see below), whose sum is σ = 254230733433600. Its totient is φ = 77855429114496.
The previous prime is 142440053346749. The next prime is 142440053346839. The reversal of 142440053346801 is 108643350044241.
142440053346801 is a `hidden beast` number, since 1 + 42 + 440 + 0 + 53 + 3 + 46 + 80 + 1 = 666.
It is not a de Polignac number, because 142440053346801 - 218 = 142440053084657 is a prime.
It is a super-2 number, since 2×1424400533468012 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (142440053346401) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 3425016 + ... + 17222393.
It is an arithmetic number, because the mean of its divisors is an integer number (3177884167920).
Almost surely, 2142440053346801 is an apocalyptic number.
It is an amenable number.
142440053346801 is a deficient number, since it is larger than the sum of its proper divisors (111790680086799).
142440053346801 is an frugal number, since it uses more digits than its factorization.
142440053346801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20647497 (or 20647442 counting only the distinct ones).
The product of its (nonzero) digits is 1105920, while the sum is 45.
The spelling of 142440053346801 in words is "one hundred forty-two trillion, four hundred forty billion, fifty-three million, three hundred forty-six thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •