Base | Representation |
---|---|
bin | 1000100100001010110… |
… | …1010001100101110101 |
3 | 112001211000000120212110 |
4 | 2021002231101211311 |
5 | 4402324400142403 |
6 | 151333205241233 |
7 | 13426315545354 |
oct | 2110255214565 |
9 | 461730016773 |
10 | 147148052853 |
11 | 5745027003a |
12 | 24627703219 |
13 | 10b50764779 |
14 | 719cac799b |
15 | 3c63533103 |
hex | 2242b51975 |
147148052853 has 4 divisors (see below), whose sum is σ = 196197403808. Its totient is φ = 98098701900.
The previous prime is 147148052833. The next prime is 147148052879. The reversal of 147148052853 is 358250841741.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 147148052853 - 210 = 147148051829 is a prime.
It is a super-3 number, since 3×1471480528533 (a number of 34 digits) contains 333 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 (147148052833) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24524675473 + ... + 24524675478.
It is an arithmetic number, because the mean of its divisors is an integer number (49049350952).
Almost surely, 2147148052853 is an apocalyptic number.
It is an amenable number.
147148052853 is a deficient number, since it is larger than the sum of its proper divisors (49049350955).
147148052853 is an equidigital number, since it uses as much as digits as its factorization.
147148052853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49049350954.
The product of its (nonzero) digits is 1075200, while the sum is 48.
The spelling of 147148052853 in words is "one hundred forty-seven billion, one hundred forty-eight million, fifty-two thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •