Base | Representation |
---|---|
bin | 100000011000001101100100… |
… | …110101000110101001001100 |
3 | 200200012102201200200201021001 |
4 | 200120031210311012221030 |
5 | 122131100412034410244 |
6 | 1222510134032550044 |
7 | 41665104523305160 |
oct | 4030154465065114 |
9 | 620172650621231 |
10 | 142401332341324 |
11 | 4141207a791161 |
12 | 13b7a3ba0b2324 |
13 | 615c507632944 |
14 | 2724392c7cca0 |
15 | 116e2bad405d4 |
hex | 818364d46a4c |
142401332341324 has 24 divisors (see below), whose sum is σ = 284802918934688. Its totient is φ = 61029087949440.
The previous prime is 142401332341321. The next prime is 142401332341361. The reversal of 142401332341324 is 423143233104241.
It is not an unprimeable number, because it can be changed into a prime (142401332341321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55016632 + ... + 57546784.
Almost surely, 2142401332341324 is an apocalyptic number.
142401332341324 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
142401332341324 is an abundant number, since it is smaller than the sum of its proper divisors (142401586593364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142401332341324 is a wasteful number, since it uses less digits than its factorization.
142401332341324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4540225 (or 4540223 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 37.
Adding to 142401332341324 its reverse (423143233104241), we get a palindrome (565544565445565).
The spelling of 142401332341324 in words is "one hundred forty-two trillion, four hundred one billion, three hundred thirty-two million, three hundred forty-one thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •