Base | Representation |
---|---|
bin | 1000010001100010011… |
… | …0011111001100110100 |
3 | 111120220110000200002101 |
4 | 2010120212133030310 |
5 | 4312104021210340 |
6 | 145145024151444 |
7 | 13161345462442 |
oct | 2043046371464 |
9 | 446813020071 |
10 | 142146663220 |
11 | 553140a3a81 |
12 | 23670768584 |
13 | 1053453a513 |
14 | 6c46783b92 |
15 | 3a6e404c9a |
hex | 211899f334 |
142146663220 has 24 divisors (see below), whose sum is σ = 299101469184. Its totient is φ = 56745622176.
The previous prime is 142146663203. The next prime is 142146663227. The reversal of 142146663220 is 22366641241.
It is a self number, because there is not a number n which added to its sum of digits gives 142146663220.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142146663227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7054884 + ... + 7075003.
It is an arithmetic number, because the mean of its divisors is an integer number (12462561216).
Almost surely, 2142146663220 is an apocalyptic number.
142146663220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
142146663220 is an abundant number, since it is smaller than the sum of its proper divisors (156954805964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142146663220 is a wasteful number, since it uses less digits than its factorization.
142146663220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14130399 (or 14130397 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 37.
The spelling of 142146663220 in words is "one hundred forty-two billion, one hundred forty-six million, six hundred sixty-three thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •