Base | Representation |
---|---|
bin | 1000010011001111101… |
… | …1000010011101100000 |
3 | 111122002101112101110022 |
4 | 2010303323002131200 |
5 | 4314023342112420 |
6 | 145302320453012 |
7 | 13205612541404 |
oct | 2046373023540 |
9 | 448071471408 |
10 | 142605035360 |
11 | 55529908827 |
12 | 2377a17a168 |
13 | 105a84a8b38 |
14 | 6c8b5c1104 |
15 | 3a99798c25 |
hex | 2133ec2760 |
142605035360 has 24 divisors (see below), whose sum is σ = 336904396416. Its totient is φ = 57042014080.
The previous prime is 142605035351. The next prime is 142605035371. The reversal of 142605035360 is 63530506241.
It is a super-2 number, since 2×1426050353602 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 142605035360.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 445640576 + ... + 445640895.
It is an arithmetic number, because the mean of its divisors is an integer number (14037683184).
Almost surely, 2142605035360 is an apocalyptic number.
142605035360 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
142605035360 is an abundant number, since it is smaller than the sum of its proper divisors (194299361056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142605035360 is an equidigital number, since it uses as much as digits as its factorization.
142605035360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 891281486 (or 891281478 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 35.
The spelling of 142605035360 in words is "one hundred forty-two billion, six hundred five million, thirty-five thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •