Base | Representation |
---|---|
bin | 1000100011101110011… |
… | …0110101001100001011 |
3 | 112001111200212011122010 |
4 | 2020323212311030023 |
5 | 4402103401020042 |
6 | 151313312031003 |
7 | 13423341140421 |
oct | 2107346651413 |
9 | 461450764563 |
10 | 147028923147 |
11 | 57399aa3137 |
12 | 245b3832463 |
13 | 10b31b83a12 |
14 | 718ad57111 |
15 | 3c57d5059c |
hex | 223b9b530b |
147028923147 has 8 divisors (see below), whose sum is σ = 198400474944. Its totient is φ = 96838326728.
The previous prime is 147028923137. The next prime is 147028923161. The reversal of 147028923147 is 741329820741.
147028923147 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 147028923147 - 210 = 147028922123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 147028923096 and 147028923105.
It is not an unprimeable number, because it can be changed into a prime (147028923137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 295238553 + ... + 295239050.
It is an arithmetic number, because the mean of its divisors is an integer number (24800059368).
Almost surely, 2147028923147 is an apocalyptic number.
147028923147 is a deficient number, since it is larger than the sum of its proper divisors (51371551797).
147028923147 is an equidigital number, since it uses as much as digits as its factorization.
147028923147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 590477689.
The product of its (nonzero) digits is 677376, while the sum is 48.
The spelling of 147028923147 in words is "one hundred forty-seven billion, twenty-eight million, nine hundred twenty-three thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •