Base | Representation |
---|---|
bin | 10111001110001110110111… |
… | …101111111100010110110111 |
3 | 111101121211102001100121022102 |
4 | 113032032313233330112313 |
5 | 101341322102143130403 |
6 | 1001115145243452315 |
7 | 30340605452113343 |
oct | 2716166757742667 |
9 | 441554361317272 |
10 | 102133110130103 |
11 | 2a5a7455077948 |
12 | b5560b7b2709b |
13 | 44cb159a159c0 |
14 | 1b313a9c40623 |
15 | bc1ab36aab88 |
hex | 5ce3b7bfc5b7 |
102133110130103 has 8 divisors (see below), whose sum is σ = 109989611222400. Its totient is φ = 94276624467168.
The previous prime is 102133110130099. The next prime is 102133110130187. The reversal of 102133110130103 is 301031011331201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102133110130103 - 22 = 102133110130099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102133110430103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12441338 + ... + 18948696.
It is an arithmetic number, because the mean of its divisors is an integer number (13748701402800).
Almost surely, 2102133110130103 is an apocalyptic number.
102133110130103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
102133110130103 is a deficient number, since it is larger than the sum of its proper divisors (7856501092297).
102133110130103 is a wasteful number, since it uses less digits than its factorization.
102133110130103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7714681.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 102133110130103 its reverse (301031011331201), we get a palindrome (403164121461304).
The spelling of 102133110130103 in words is "one hundred two trillion, one hundred thirty-three billion, one hundred ten million, one hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •