Base | Representation |
---|---|
bin | 1000100011101000011… |
… | …0010010001000101100 |
3 | 112001102221020022122200 |
4 | 2020322012102020230 |
5 | 4402030411114430 |
6 | 151311005341500 |
7 | 13422613046154 |
oct | 2107206221054 |
9 | 461387208580 |
10 | 147003613740 |
11 | 57386786875 |
12 | 245a7267890 |
13 | 10b29861a39 |
14 | 7187849764 |
15 | 3c55a01460 |
hex | 223a19222c |
147003613740 has 36 divisors (see below), whose sum is σ = 445910962224. Its totient is φ = 39200963616.
The previous prime is 147003613739. The next prime is 147003613747. The reversal of 147003613740 is 47316300741.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×1470036137402 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 147003613695 and 147003613704.
It is not an unprimeable number, because it can be changed into a prime (147003613747) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 408343192 + ... + 408343551.
Almost surely, 2147003613740 is an apocalyptic number.
147003613740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
147003613740 is an abundant number, since it is smaller than the sum of its proper divisors (298907348484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147003613740 is a wasteful number, since it uses less digits than its factorization.
147003613740 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 816686758 (or 816686753 counting only the distinct ones).
The product of its (nonzero) digits is 42336, while the sum is 36.
The spelling of 147003613740 in words is "one hundred forty-seven billion, three million, six hundred thirteen thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •