Base | Representation |
---|---|
bin | 10111001110000011110001… |
… | …111010100110100100101101 |
3 | 111101120200200002102020201012 |
4 | 113032003301322212210231 |
5 | 101341123204440213401 |
6 | 1001105455423555005 |
7 | 30340004364045230 |
oct | 2716036172464455 |
9 | 441520602366635 |
10 | 102121201101101 |
11 | 2a5a23a3800116 |
12 | b55393375ba65 |
13 | 44c9cac683090 |
14 | 1b3099a343417 |
15 | bc1617e098bb |
hex | 5ce0f1ea692d |
102121201101101 has 32 divisors (see below), whose sum is σ = 132450849796608. Its totient is φ = 76520973830400.
The previous prime is 102121201101047. The next prime is 102121201101103. The reversal of 102121201101101 is 101101102121201.
It is a cyclic number.
It is not a de Polignac number, because 102121201101101 - 26 = 102121201101037 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102121201101103) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 241332086 + ... + 241754871.
It is an arithmetic number, because the mean of its divisors is an integer number (4139089056144).
Almost surely, 2102121201101101 is an apocalyptic number.
It is an amenable number.
102121201101101 is a deficient number, since it is larger than the sum of its proper divisors (30329648695507).
102121201101101 is a wasteful number, since it uses less digits than its factorization.
102121201101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 483087101.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102121201101101 its reverse (101101102121201), we get a palindrome (203222303222302).
It can be divided in two parts, 102121201 and 101101, that multiplied together give a palindrome (10324555542301).
The spelling of 102121201101101 in words is "one hundred two trillion, one hundred twenty-one billion, two hundred one million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •