Base | Representation |
---|---|
bin | 10111001111001101001100… |
… | …000100110010011111000111 |
3 | 111101212020010022222022000202 |
4 | 113033031030010302133013 |
5 | 101343421121410211403 |
6 | 1001210013101401115 |
7 | 30345464563210001 |
oct | 2717151404623707 |
9 | 441766108868022 |
10 | 102200023132103 |
11 | 2a6228717886a6 |
12 | b567070b6919b |
13 | 4504561738400 |
14 | 1b34716885371 |
15 | bc36ccc90688 |
hex | 5cf34c1327c7 |
102200023132103 has 12 divisors (see below), whose sum is σ = 110751622299648. Its totient is φ = 94265746773120.
The previous prime is 102200023132093. The next prime is 102200023132177. The reversal of 102200023132103 is 301231320002201.
It is not a de Polignac number, because 102200023132103 - 24 = 102200023132087 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 (102200023132703) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 232908743 + ... + 233347128.
It is an arithmetic number, because the mean of its divisors is an integer number (9229301858304).
Almost surely, 2102200023132103 is an apocalyptic number.
102200023132103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
102200023132103 is a deficient number, since it is larger than the sum of its proper divisors (8551599167545).
102200023132103 is a wasteful number, since it uses less digits than its factorization.
102200023132103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466257194 (or 466257181 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 102200023132103 its reverse (301231320002201), we get a palindrome (403431343134304).
The spelling of 102200023132103 in words is "one hundred two trillion, two hundred billion, twenty-three million, one hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •