Base | Representation |
---|---|
bin | 1000100010101100001… |
… | …1010000000110000000 |
3 | 112000210100012101012020 |
4 | 2020223003100012000 |
5 | 4401021244120304 |
6 | 151225550401440 |
7 | 13413426166401 |
oct | 2105303200600 |
9 | 460710171166 |
10 | 146751160704 |
11 | 572672280a5 |
12 | 24536800280 |
13 | 10ab9470945 |
14 | 71620d19a8 |
15 | 3c3d7855d9 |
hex | 222b0d0180 |
146751160704 has 128 divisors (see below), whose sum is σ = 407447470080. Its totient is φ = 46710681600.
The previous prime is 146751160693. The next prime is 146751160771. The reversal of 146751160704 is 407061157641.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5294209 + ... + 5321855.
It is an arithmetic number, because the mean of its divisors is an integer number (3183183360).
Almost surely, 2146751160704 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 146751160704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (203723735040).
146751160704 is an abundant number, since it is smaller than the sum of its proper divisors (260696309376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146751160704 is a wasteful number, since it uses less digits than its factorization.
146751160704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28288 (or 28276 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 42.
The spelling of 146751160704 in words is "one hundred forty-six billion, seven hundred fifty-one million, one hundred sixty thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •