Base | Representation |
---|---|
bin | 100000010011111110101101… |
… | …110110010001010111111000 |
3 | 200122011122001001121002100102 |
4 | 200103332231312101113320 |
5 | 122111314300344424211 |
6 | 1222124355014054532 |
7 | 41635100441666630 |
oct | 4023765566212770 |
9 | 618148031532312 |
10 | 142110499608056 |
11 | 4130a7a7241061 |
12 | 13b31b7294a448 |
13 | 613ac68b1a525 |
14 | 27142834536c0 |
15 | 116694839da3b |
hex | 813fadd915f8 |
142110499608056 has 64 divisors (see below), whose sum is σ = 314400109608960. Its totient is φ = 58929656544000.
The previous prime is 142110499608053. The next prime is 142110499608067. The reversal of 142110499608056 is 650806994011241.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (56).
It is a junction number, because it is equal to n+sod(n) for n = 142110499607992 and 142110499608010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142110499608053) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2985236 + ... + 17121116.
It is an arithmetic number, because the mean of its divisors is an integer number (4912501712640).
Almost surely, 2142110499608056 is an apocalyptic number.
It is an amenable number.
142110499608056 is an abundant number, since it is smaller than the sum of its proper divisors (172289610000904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142110499608056 is a wasteful number, since it uses less digits than its factorization.
142110499608056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14141716 (or 14141712 counting only the distinct ones).
The product of its (nonzero) digits is 3732480, while the sum is 56.
The spelling of 142110499608056 in words is "one hundred forty-two trillion, one hundred ten billion, four hundred ninety-nine million, six hundred eight thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •