Base | Representation |
---|---|
bin | 10111001111001101001100… |
… | …101010011110000110110101 |
3 | 111101212020011000120011002112 |
4 | 113033031030222132012311 |
5 | 101343421131422310401 |
6 | 1001210014053220405 |
7 | 30345465043160555 |
oct | 2717151452360665 |
9 | 441766130504075 |
10 | 102200033010101 |
11 | 2a622877315134 |
12 | b567074331705 |
13 | 45045637b6590 |
14 | 1b34717cd7165 |
15 | bc36cda923bb |
hex | 5cf34ca9e1b5 |
102200033010101 has 32 divisors (see below), whose sum is σ = 117935743752288. Its totient is φ = 87725620592640.
The previous prime is 102200033010043. The next prime is 102200033010151. The reversal of 102200033010101 is 101010330002201.
It can be written as a sum of positive squares in 16 ways, for example, as 20106031800625 + 82094001209476 = 4483975^2 + 9060574^2 .
It is a cyclic number.
It is not a de Polignac number, because 102200033010101 - 230 = 102198959268277 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102200033010151) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8692361 + ... + 16731921.
It is an arithmetic number, because the mean of its divisors is an integer number (3685491992259).
Almost surely, 2102200033010101 is an apocalyptic number.
It is an amenable number.
102200033010101 is a deficient number, since it is larger than the sum of its proper divisors (15735710742187).
102200033010101 is a wasteful number, since it uses less digits than its factorization.
102200033010101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8040281.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 102200033010101 its reverse (101010330002201), we get a palindrome (203210363012302).
The spelling of 102200033010101 in words is "one hundred two trillion, two hundred billion, thirty-three million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •