Base | Representation |
---|---|
bin | 11001000000101111011100… |
… | …000110110110011000111101 |
3 | 112102111002122111110001022002 |
4 | 121000233130012312120331 |
5 | 103404233300122413041 |
6 | 1025542133414232045 |
7 | 32112250406111600 |
oct | 3100573406663075 |
9 | 472432574401262 |
10 | 110002100201021 |
11 | 320606a08a6316 |
12 | 10407188955625 |
13 | 494c1cc42c962 |
14 | 1d241b6c40337 |
15 | cab618cb959b |
hex | 640bdc1b663d |
110002100201021 has 48 divisors (see below), whose sum is σ = 131255927193600. Its totient is φ = 91878569018208.
The previous prime is 110002100200999. The next prime is 110002100201093. The reversal of 110002100201021 is 120102001200011.
It is not a de Polignac number, because 110002100201021 - 218 = 110002099938877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110002100200993 and 110002100201011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110002100201821) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 484163570 + ... + 484390716.
It is an arithmetic number, because the mean of its divisors is an integer number (2734498483200).
Almost surely, 2110002100201021 is an apocalyptic number.
It is an amenable number.
110002100201021 is a deficient number, since it is larger than the sum of its proper divisors (21253826992579).
110002100201021 is a wasteful number, since it uses less digits than its factorization.
110002100201021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 228126 (or 228119 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110002100201021 its reverse (120102001200011), we get a palindrome (230104101401032).
The spelling of 110002100201021 in words is "one hundred ten trillion, two billion, one hundred million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •