Base | Representation |
---|---|
bin | 10111001101110000000100… |
… | …000101000101001000001111 |
3 | 111101111200000201010202000111 |
4 | 113031300010011011020033 |
5 | 101340301330414013403 |
6 | 1001052035015140451 |
7 | 30335324643134122 |
oct | 2715600405051017 |
9 | 441450021122014 |
10 | 102100031001103 |
11 | 2a59441a837703 |
12 | b54b805974727 |
13 | 44c7cb77525a5 |
14 | 1b2d94c8b23b9 |
15 | bc0cc95ac56d |
hex | 5cdc0414520f |
102100031001103 has 4 divisors (see below), whose sum is σ = 102101055286320. Its totient is φ = 102099006715888.
The previous prime is 102100031001053. The next prime is 102100031001217. The reversal of 102100031001103 is 301100130001201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102100031001103 - 217 = 102100030870031 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 (102100031091103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 511993075 + ... + 512192452.
It is an arithmetic number, because the mean of its divisors is an integer number (25525263821580).
Almost surely, 2102100031001103 is an apocalyptic number.
102100031001103 is a deficient number, since it is larger than the sum of its proper divisors (1024285217).
102100031001103 is an equidigital number, since it uses as much as digits as its factorization.
102100031001103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1024285216.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 102100031001103 its reverse (301100130001201), we get a palindrome (403200161002304).
The spelling of 102100031001103 in words is "one hundred two trillion, one hundred billion, thirty-one million, one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •