Base | Representation |
---|---|
bin | 11111000010110011111… |
… | …001011001101111111101 |
3 | 21112221110212121112202211 |
4 | 133002303321121233331 |
5 | 234423020404320112 |
6 | 4312011245020421 |
7 | 310061464236331 |
oct | 37026371315775 |
9 | 7487425545684 |
10 | 2133321948157 |
11 | 752811695814 |
12 | 2a5551254711 |
13 | 12622c7342aa |
14 | 753792097c1 |
15 | 3a75c7cc0a7 |
hex | 1f0b3e59bfd |
2133321948157 has 2 divisors, whose sum is σ = 2133321948158. Its totient is φ = 2133321948156.
The previous prime is 2133321948119. The next prime is 2133321948169. The reversal of 2133321948157 is 7518491233312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1139404670041 + 993917278116 = 1067429^2 + 996954^2 .
It is a cyclic number.
It is not a de Polignac number, because 2133321948157 - 27 = 2133321948029 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2133321948157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2133321946157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1066660974078 + 1066660974079.
It is an arithmetic number, because the mean of its divisors is an integer number (1066660974079).
Almost surely, 22133321948157 is an apocalyptic number.
It is an amenable number.
2133321948157 is a deficient number, since it is larger than the sum of its proper divisors (1).
2133321948157 is an equidigital number, since it uses as much as digits as its factorization.
2133321948157 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1088640, while the sum is 49.
It can be divided in two parts, 21333219 and 48157, that added together give a 4-th power (21381376 = 684).
The spelling of 2133321948157 in words is "two trillion, one hundred thirty-three billion, three hundred twenty-one million, nine hundred forty-eight thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •