Base | Representation |
---|---|
bin | 100001100100101000111101… |
… | …101001111110010011010101 |
3 | 201100210112021201102121002021 |
4 | 201210220331221332103111 |
5 | 123323123201022141112 |
6 | 1242011013401213141 |
7 | 43046415252633265 |
oct | 4144507551762325 |
9 | 640715251377067 |
10 | 147653420115157 |
11 | 4305751137a290 |
12 | 1468827b7911b1 |
13 | 6450872182a08 |
14 | 286666c41d7a5 |
15 | 1210c0e7ca907 |
hex | 864a3da7e4d5 |
147653420115157 has 8 divisors (see below), whose sum is σ = 161078725640160. Its totient is φ = 134228492478960.
The previous prime is 147653420115139. The next prime is 147653420115251. The reversal of 147653420115157 is 751511024356741.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 147653420115157 - 211 = 147653420113109 is a prime.
It is a super-2 number, since 2×1476534201151572 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (147653420115107) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 93654903 + ... + 95218420.
It is an arithmetic number, because the mean of its divisors is an integer number (20134840705020).
Almost surely, 2147653420115157 is an apocalyptic number.
It is an amenable number.
147653420115157 is a deficient number, since it is larger than the sum of its proper divisors (13425305525003).
147653420115157 is a wasteful number, since it uses less digits than its factorization.
147653420115157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188944403.
The product of its (nonzero) digits is 3528000, while the sum is 52.
The spelling of 147653420115157 in words is "one hundred forty-seven trillion, six hundred fifty-three billion, four hundred twenty million, one hundred fifteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.043 sec. • engine limits •