Base | Representation |
---|---|
bin | 100000010111100111100110… |
… | …011000100110000101011101 |
3 | 200200001112110221020210100210 |
4 | 200113213212120212011131 |
5 | 122124413404343424203 |
6 | 1222435311531243033 |
7 | 41662132203146064 |
oct | 4027474630460535 |
9 | 620045427223323 |
10 | 142360556233053 |
11 | 413a6855730524 |
12 | 13b7251a2a9479 |
13 | 6158709844122 |
14 | 27224055a51db |
15 | 116d1d1150803 |
hex | 8179e662615d |
142360556233053 has 32 divisors (see below), whose sum is σ = 198055793295360. Its totient is φ = 90890987342400.
The previous prime is 142360556232943. The next prime is 142360556233117. The reversal of 142360556233053 is 350332655063241.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-142360556233053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142360556232993 and 142360556233011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142360556233153) 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 31 ways as a sum of consecutive naturals, for example, 51698973 + ... + 54382946.
It is an arithmetic number, because the mean of its divisors is an integer number (6189243540480).
Almost surely, 2142360556233053 is an apocalyptic number.
It is an amenable number.
142360556233053 is a deficient number, since it is larger than the sum of its proper divisors (55695237062307).
142360556233053 is a wasteful number, since it uses less digits than its factorization.
142360556233053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106082169.
The product of its (nonzero) digits is 5832000, while the sum is 48.
The spelling of 142360556233053 in words is "one hundred forty-two trillion, three hundred sixty billion, five hundred fifty-six million, two hundred thirty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •