Base | Representation |
---|---|
bin | 10111001101110001001010… |
… | …011010011011000010101001 |
3 | 111101111210001221111221120102 |
4 | 113031301022122123002221 |
5 | 101340311240004013001 |
6 | 1001052352050435145 |
7 | 30335366122023062 |
oct | 2715611232330251 |
9 | 441453057457512 |
10 | 102101211001001 |
11 | 2a594975923033 |
12 | b54ba94b92ab5 |
13 | 44c8145063594 |
14 | 1b2da214b7569 |
15 | bc0d47e96e6b |
hex | 5cdc4a69b0a9 |
102101211001001 has 8 divisors (see below), whose sum is σ = 103064147198784. Its totient is φ = 101138436271440.
The previous prime is 102101211000967. The next prime is 102101211001061. The reversal of 102101211001001 is 100100112101201.
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 102101211001001 - 26 = 102101211000937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102101211001061) 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, 39096245 + ... + 41625938.
It is an arithmetic number, because the mean of its divisors is an integer number (12883018399848).
Almost surely, 2102101211001001 is an apocalyptic number.
It is an amenable number.
102101211001001 is a deficient number, since it is larger than the sum of its proper divisors (962936197783).
102101211001001 is a wasteful number, since it uses less digits than its factorization.
102101211001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80734111.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 102101211001001 its reverse (100100112101201), we get a palindrome (202201323102202).
The spelling of 102101211001001 in words is "one hundred two trillion, one hundred one billion, two hundred eleven million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •