Base | Representation |
---|---|
bin | 100000011000100011000100… |
… | …000110110001110011010111 |
3 | 200200021122021201012001201022 |
4 | 200120203010012301303113 |
5 | 122131440140321142201 |
6 | 1222524511345551355 |
7 | 41666552354205500 |
oct | 4030430406616327 |
9 | 620248251161638 |
10 | 142424405646551 |
11 | 4142093aa99956 |
12 | 13b8297934555b |
13 | 6161743949b82 |
14 | 27255413adba7 |
15 | 116ebbb7d041b |
hex | 8188c41b1cd7 |
142424405646551 has 48 divisors (see below), whose sum is σ = 176099653437120. Its totient is φ = 114454118338560.
The previous prime is 142424405646521. The next prime is 142424405646553. The reversal of 142424405646551 is 155646504424241.
It is not a de Polignac number, because 142424405646551 - 214 = 142424405630167 is a prime.
It is a super-2 number, since 2×1424244056465512 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 142424405646493 and 142424405646502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142424405646553) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 803483990 + ... + 803661228.
It is an arithmetic number, because the mean of its divisors is an integer number (3668742779940).
Almost surely, 2142424405646551 is an apocalyptic number.
142424405646551 is a deficient number, since it is larger than the sum of its proper divisors (33675247790569).
142424405646551 is a wasteful number, since it uses less digits than its factorization.
142424405646551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 180984 (or 180977 counting only the distinct ones).
The product of its (nonzero) digits is 18432000, while the sum is 53.
The spelling of 142424405646551 in words is "one hundred forty-two trillion, four hundred twenty-four billion, four hundred five million, six hundred forty-six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •