Base | Representation |
---|---|
bin | 10111001100011101010110… |
… | …101001101100111110100001 |
3 | 111101012011210110101001200012 |
4 | 113030131112221230332201 |
5 | 101332322440314120001 |
6 | 1000543150342334305 |
7 | 30326032115221640 |
oct | 2714352651547641 |
9 | 441164713331605 |
10 | 102011222020001 |
11 | 2a55a797448758 |
12 | b53655ba2a395 |
13 | 44bc8035cb928 |
14 | 1b29525c47357 |
15 | bbd82ca952bb |
hex | 5cc756a6cfa1 |
102011222020001 has 4 divisors (see below), whose sum is σ = 116584253737152. Its totient is φ = 87438190302852.
The previous prime is 102011222019977. The next prime is 102011222020039. The reversal of 102011222020001 is 100020222110201.
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 not a de Polignac number, because 102011222020001 - 222 = 102011217825697 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (102011222020091) 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, 7286515858565 + ... + 7286515858578.
It is an arithmetic number, because the mean of its divisors is an integer number (29146063434288).
Almost surely, 2102011222020001 is an apocalyptic number.
It is an amenable number.
102011222020001 is a deficient number, since it is larger than the sum of its proper divisors (14573031717151).
102011222020001 is an equidigital number, since it uses as much as digits as its factorization.
102011222020001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14573031717150.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 102011222020001 its reverse (100020222110201), we get a palindrome (202031444130202).
The spelling of 102011222020001 in words is "one hundred two trillion, eleven billion, two hundred twenty-two million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •