Base | Representation |
---|---|
bin | 100000010111011111000000… |
… | …100110011110111110000001 |
3 | 200200000122200002222210011001 |
4 | 200113133000212132332001 |
5 | 122124241012043430441 |
6 | 1222431144352452001 |
7 | 41661354501666340 |
oct | 4027370046367601 |
9 | 620018602883131 |
10 | 142351332405121 |
11 | 413a2952062034 |
12 | 13b7078524a001 |
13 | 61578998b5c88 |
14 | 2721bac567b57 |
15 | 116cd414ae731 |
hex | 8177c099ef81 |
142351332405121 has 16 divisors (see below), whose sum is σ = 162726883200000. Its totient is φ = 121985694819648.
The previous prime is 142351332405083. The next prime is 142351332405203. The reversal of 142351332405121 is 121504233153241.
It is a cyclic number.
It is not a de Polignac number, because 142351332405121 - 221 = 142351330307969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (142351332405521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1762846255 + ... + 1762927003.
It is an arithmetic number, because the mean of its divisors is an integer number (10170430200000).
Almost surely, 2142351332405121 is an apocalyptic number.
It is an amenable number.
142351332405121 is a deficient number, since it is larger than the sum of its proper divisors (20375550794879).
142351332405121 is an equidigital number, since it uses as much as digits as its factorization.
142351332405121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139008.
The product of its (nonzero) digits is 86400, while the sum is 37.
Adding to 142351332405121 its reverse (121504233153241), we get a palindrome (263855565558362).
The spelling of 142351332405121 in words is "one hundred forty-two trillion, three hundred fifty-one billion, three hundred thirty-two million, four hundred five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •