Base | Representation |
---|---|
bin | 101110110111001001101011… |
… | …010000010101001101100001 |
3 | 1000000201222101100012000122202 |
4 | 232313021223100111031201 |
5 | 204003221001111443103 |
6 | 2010201025013142545 |
7 | 61261145416602635 |
oct | 5667115320251541 |
9 | 1000658340160582 |
10 | 206100100109153 |
11 | 5a74061a547338 |
12 | 1b1476b662aa55 |
13 | 8b00204aac7a3 |
14 | 38c7425c92dc5 |
15 | 18c620ae38988 |
hex | bb726b415361 |
206100100109153 has 2 divisors, whose sum is σ = 206100100109154. Its totient is φ = 206100100109152.
The previous prime is 206100100109083. The next prime is 206100100109213. The reversal of 206100100109153 is 351901001001602.
206100100109153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 203240578525009 + 2859521584144 = 14256247^2 + 1691012^2 .
It is a cyclic number.
It is not a de Polignac number, because 206100100109153 - 212 = 206100100105057 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (206100100309153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 103050050054576 + 103050050054577.
It is an arithmetic number, because the mean of its divisors is an integer number (103050050054577).
Almost surely, 2206100100109153 is an apocalyptic number.
It is an amenable number.
206100100109153 is a deficient number, since it is larger than the sum of its proper divisors (1).
206100100109153 is an equidigital number, since it uses as much as digits as its factorization.
206100100109153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1620, while the sum is 29.
The spelling of 206100100109153 in words is "two hundred six trillion, one hundred billion, one hundred million, one hundred nine thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •