Base | Representation |
---|---|
bin | 100000010100010001010010… |
… | …100101000111101111110000 |
3 | 200122020112111222000122110201 |
4 | 200110101102211013233300 |
5 | 122112131121431101000 |
6 | 1222141454011004544 |
7 | 41636404610630662 |
oct | 4024212245075760 |
9 | 618215458018421 |
10 | 142130443222000 |
11 | 41318200958432 |
12 | 13b359b9a39754 |
13 | 613cac691211c |
14 | 271521605c532 |
15 | 11672141cc96a |
hex | 814452947bf0 |
142130443222000 has 80 divisors (see below), whose sum is σ = 343678397897952. Its totient is φ = 56851021593600.
The previous prime is 142130443221967. The next prime is 142130443222049. The reversal of 142130443222000 is 222344031241.
It is a tau number, because it is divible by the number of its divisors (80).
It is a self number, because there is not a number n which added to its sum of digits gives 142130443222000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 101289187 + ... + 102682813.
Almost surely, 2142130443222000 is an apocalyptic number.
142130443222000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
142130443222000 is an abundant number, since it is smaller than the sum of its proper divisors (201547954675952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142130443222000 is a wasteful number, since it uses less digits than its factorization.
142130443222000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1444643 (or 1444627 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 142130443222000 its reverse (222344031241), we get a palindrome (142352787253241).
The spelling of 142130443222000 in words is "one hundred forty-two trillion, one hundred thirty billion, four hundred forty-three million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •