Base | Representation |
---|---|
bin | 100001100100111010100011… |
… | …000111101011111010000101 |
3 | 201100212100000122112112222112 |
4 | 201210322203013223322011 |
5 | 123323430333340202013 |
6 | 1242023415155310405 |
7 | 43050654212420522 |
oct | 4144724307537205 |
9 | 640770018475875 |
10 | 147672302272133 |
11 | 430645209072a1 |
12 | 1468ba6b2ab405 |
13 | 64525910a0272 |
14 | 2867540080149 |
15 | 1211467338ba8 |
hex | 864ea31ebe85 |
147672302272133 has 2 divisors, whose sum is σ = 147672302272134. Its totient is φ = 147672302272132.
The previous prime is 147672302272111. The next prime is 147672302272213. The reversal of 147672302272133 is 331272203276741.
147672302272133 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., 103416838731649 + 44255463540484 = 10169407^2 + 6652478^2 .
It is a cyclic number.
It is not a de Polignac number, because 147672302272133 - 224 = 147672285494917 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (147672302275133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73836151136066 + 73836151136067.
It is an arithmetic number, because the mean of its divisors is an integer number (73836151136067).
Almost surely, 2147672302272133 is an apocalyptic number.
It is an amenable number.
147672302272133 is a deficient number, since it is larger than the sum of its proper divisors (1).
147672302272133 is an equidigital number, since it uses as much as digits as its factorization.
147672302272133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3556224, while the sum is 50.
The spelling of 147672302272133 in words is "one hundred forty-seven trillion, six hundred seventy-two billion, three hundred two million, two hundred seventy-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •