Base | Representation |
---|---|
bin | 10111001101111010010111… |
… | …111010010001100011111011 |
3 | 111101112201121012112121101121 |
4 | 113031322113322101203323 |
5 | 101340442013342143003 |
6 | 1001101105310330111 |
7 | 30336166163524246 |
oct | 2715722772214373 |
9 | 441481535477347 |
10 | 102111101131003 |
11 | 2a599090615098 |
12 | b5519951b9937 |
13 | 44c9060062903 |
14 | 1b302bcbda25d |
15 | bc12263a0cbd |
hex | 5cde97e918fb |
102111101131003 has 8 divisors (see below), whose sum is σ = 102428467941888. Its totient is φ = 101793998686464.
The previous prime is 102111101130967. The next prime is 102111101131009. The reversal of 102111101131003 is 300131101111201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102111101131003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102111101131009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65317876 + ... + 66862897.
It is an arithmetic number, because the mean of its divisors is an integer number (12803558492736).
Almost surely, 2102111101131003 is an apocalyptic number.
102111101131003 is a deficient number, since it is larger than the sum of its proper divisors (317366810885).
102111101131003 is a wasteful number, since it uses less digits than its factorization.
102111101131003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132183173.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 102111101131003 its reverse (300131101111201), we get a palindrome (402242202242204).
The spelling of 102111101131003 in words is "one hundred two trillion, one hundred eleven billion, one hundred one million, one hundred thirty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •