Base | Representation |
---|---|
bin | 1000010010000000110… |
… | …0001010110000000000 |
3 | 111121020022121002212000 |
4 | 2010200030022300000 |
5 | 4312334114401230 |
6 | 145205413104000 |
7 | 13164452613543 |
oct | 2044014126000 |
9 | 447208532760 |
10 | 142273981440 |
11 | 55379a54048 |
12 | 236a7328000 |
13 | 10554a27446 |
14 | 6c5964685a |
15 | 3a7a6a3b60 |
hex | 212030ac00 |
142273981440 has 704 divisors, whose sum is σ = 546146150400. Its totient is φ = 35016081408.
The previous prime is 142273981391. The next prime is 142273981457. The reversal of 142273981440 is 44189372241.
142273981440 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 92205309 + ... + 92206851.
Almost surely, 2142273981440 is an apocalyptic number.
142273981440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 142273981440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (273073075200).
142273981440 is an abundant number, since it is smaller than the sum of its proper divisors (403872168960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142273981440 is a wasteful number, since it uses less digits than its factorization.
142273981440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1629 (or 1605 counting only the distinct ones).
The product of its (nonzero) digits is 387072, while the sum is 45.
The spelling of 142273981440 in words is "one hundred forty-two billion, two hundred seventy-three million, nine hundred eighty-one thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •