Base | Representation |
---|---|
bin | 1000100010101011010… |
… | …1001100000001010000 |
3 | 112000210002021001222122 |
4 | 2020222311030001100 |
5 | 4401014323132000 |
6 | 151225335353412 |
7 | 13413352643111 |
oct | 2105265140120 |
9 | 460702231878 |
10 | 146747474000 |
11 | 5726513a236 |
12 | 24535522868 |
13 | 10ab877c86a |
14 | 7161812208 |
15 | 3c3d2a8085 |
hex | 222ad4c050 |
146747474000 has 40 divisors (see below), whose sum is σ = 354835396968. Its totient is φ = 58698988800.
The previous prime is 146747473993. The next prime is 146747474053. The reversal of 146747474000 is 474747641.
It can be written as a sum of positive squares in 4 ways, for example, as 401441296 + 146346032704 = 20036^2 + 382552^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×1467474740002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36684869 + ... + 36688868.
Almost surely, 2146747474000 is an apocalyptic number.
146747474000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
146747474000 is an abundant number, since it is smaller than the sum of its proper divisors (208087922968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146747474000 is an equidigital number, since it uses as much as digits as its factorization.
146747474000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73373760 (or 73373744 counting only the distinct ones).
The product of its (nonzero) digits is 526848, while the sum is 44.
The spelling of 146747474000 in words is "one hundred forty-six billion, seven hundred forty-seven million, four hundred seventy-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •