Base | Representation |
---|---|
bin | 10111001101110000001000… |
… | …111010011101001001110001 |
3 | 111101111200020100202002112110 |
4 | 113031300020322131021301 |
5 | 101340302012144231001 |
6 | 1001052051033315533 |
7 | 30335326646363646 |
oct | 2715601072351161 |
9 | 441450210662473 |
10 | 102100112102001 |
11 | 2a59446159aa42 |
12 | b54b828b65ba9 |
13 | 44c7ccb4a9aa0 |
14 | 1b2d959583dcd |
15 | bc0cd177c3d6 |
hex | 5cdc08e9d271 |
102100112102001 has 32 divisors (see below), whose sum is σ = 150682909426560. Its totient is φ = 61106433062400.
The previous prime is 102100112101909. The next prime is 102100112102003. The reversal of 102100112102001 is 100201211001201.
It is not a de Polignac number, because 102100112102001 - 214 = 102100112085617 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102100112102003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 240896355 + ... + 241319816.
It is an arithmetic number, because the mean of its divisors is an integer number (4708840919580).
Almost surely, 2102100112102001 is an apocalyptic number.
It is an amenable number.
102100112102001 is a deficient number, since it is larger than the sum of its proper divisors (48582797324559).
102100112102001 is a wasteful number, since it uses less digits than its factorization.
102100112102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482216337.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102100112102001 its reverse (100201211001201), we get a palindrome (202301323103202).
The spelling of 102100112102001 in words is "one hundred two trillion, one hundred billion, one hundred twelve million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •