Base | Representation |
---|---|
bin | 10000000000011101001… |
… | …010111000100001110101 |
3 | 10220011021221222120221022 |
4 | 100000131022320201311 |
5 | 121010300230120041 |
6 | 2201200011230525 |
7 | 142321023253241 |
oct | 20003512704165 |
9 | 3804257876838 |
10 | 1100001020021 |
11 | 394564998392 |
12 | 159230148445 |
13 | 7c964074637 |
14 | 3b351691421 |
15 | 1d930b0324b |
hex | 1001d2b8875 |
1100001020021 has 4 divisors (see below), whose sum is σ = 1100016667200. Its totient is φ = 1099985372844.
The previous prime is 1100001019973. The next prime is 1100001020029. The reversal of 1100001020021 is 1200201000011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1100001020021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100001019990 and 1100001020008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100001020029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7717661 + ... + 7858898.
It is an arithmetic number, because the mean of its divisors is an integer number (275004166800).
Almost surely, 21100001020021 is an apocalyptic number.
It is an amenable number.
1100001020021 is a deficient number, since it is larger than the sum of its proper divisors (15647179).
1100001020021 is an equidigital number, since it uses as much as digits as its factorization.
1100001020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15647178.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 1100001020021 its reverse (1200201000011), we get a palindrome (2300202020032).
The spelling of 1100001020021 in words is "one trillion, one hundred billion, one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •