Base | Representation |
---|---|
bin | 10111001110001101110110… |
… | …001100000010101111000001 |
3 | 111101121201120101122100212111 |
4 | 113032031312030002233001 |
5 | 101341312324102400001 |
6 | 1001114444152255321 |
7 | 30340536264631135 |
oct | 2716156614025701 |
9 | 441551511570774 |
10 | 102132010200001 |
11 | 2a5a6a40200101 |
12 | b555a4b6a1541 |
13 | 44cb012b8aaa2 |
14 | 1b31303b1d3c5 |
15 | bc1a4bd3a851 |
hex | 5ce376302bc1 |
102132010200001 has 8 divisors (see below), whose sum is σ = 106278481251360. Its totient is φ = 98066053149792.
The previous prime is 102132010199927. The next prime is 102132010200061. The reversal of 102132010200001 is 100002010231201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102132010200001 - 215 = 102132010167233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102132010200061) 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 7 ways as a sum of consecutive naturals, for example, 20128497700 + ... + 20128502773.
It is an arithmetic number, because the mean of its divisors is an integer number (13284810156420).
Almost surely, 2102132010200001 is an apocalyptic number.
It is an amenable number.
102132010200001 is a deficient number, since it is larger than the sum of its proper divisors (4146471051359).
102132010200001 is an equidigital number, since it uses as much as digits as its factorization.
102132010200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40257000575.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 102132010200001 its reverse (100002010231201), we get a palindrome (202134020431202).
The spelling of 102132010200001 in words is "one hundred two trillion, one hundred thirty-two billion, ten million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •