Base | Representation |
---|---|
bin | 1000100101110110101… |
… | …1010001100000010111 |
3 | 112002222112101221120102 |
4 | 2021131223101200113 |
5 | 4404241212404142 |
6 | 151450131124315 |
7 | 13443451442321 |
oct | 2113553214027 |
9 | 462875357512 |
10 | 147600513047 |
11 | 57662707089 |
12 | 2473314369b |
13 | 10bc34131b0 |
14 | 7202c26611 |
15 | 3c8d10a532 |
hex | 225dad1817 |
147600513047 has 4 divisors (see below), whose sum is σ = 158954398680. Its totient is φ = 136246627416.
The previous prime is 147600513043. The next prime is 147600513061. The reversal of 147600513047 is 740315006741.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 147600513047 - 22 = 147600513043 is a prime.
It is a super-2 number, since 2×1476005130472 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 147600513047.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (147600513043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5676942797 + ... + 5676942822.
It is an arithmetic number, because the mean of its divisors is an integer number (39738599670).
Almost surely, 2147600513047 is an apocalyptic number.
147600513047 is a deficient number, since it is larger than the sum of its proper divisors (11353885633).
147600513047 is a wasteful number, since it uses less digits than its factorization.
147600513047 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11353885632.
The product of its (nonzero) digits is 70560, while the sum is 38.
Adding to 147600513047 its reverse (740315006741), we get a palindrome (887915519788).
The spelling of 147600513047 in words is "one hundred forty-seven billion, six hundred million, five hundred thirteen thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •