Base | Representation |
---|---|
bin | 1000100100011010000… |
… | …1001110110111110101 |
3 | 112001222110100200112001 |
4 | 2021012201032313311 |
5 | 4402442233123403 |
6 | 151343412055301 |
7 | 13431023252344 |
oct | 2110641166765 |
9 | 461873320461 |
10 | 147212004853 |
11 | 57483380131 |
12 | 24645004531 |
13 | 10b60a964a4 |
14 | 71a73b3b5b |
15 | 3c68e66c1d |
hex | 224684edf5 |
147212004853 has 2 divisors, whose sum is σ = 147212004854. Its totient is φ = 147212004852.
The previous prime is 147212004851. The next prime is 147212004913. The reversal of 147212004853 is 358400212741.
147212004853 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 142580249604 + 4631755249 = 377598^2 + 68057^2 .
It is a cyclic number.
It is not a de Polignac number, because 147212004853 - 21 = 147212004851 is a prime.
Together with 147212004851, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (147212004851) 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 as a sum of consecutive naturals, namely, 73606002426 + 73606002427.
It is an arithmetic number, because the mean of its divisors is an integer number (73606002427).
Almost surely, 2147212004853 is an apocalyptic number.
It is an amenable number.
147212004853 is a deficient number, since it is larger than the sum of its proper divisors (1).
147212004853 is an equidigital number, since it uses as much as digits as its factorization.
147212004853 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 53760, while the sum is 37.
The spelling of 147212004853 in words is "one hundred forty-seven billion, two hundred twelve million, four thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •