Base | Representation |
---|---|
bin | 101101111011110010101110… |
… | …101010000111100001011111 |
3 | 222111022000112200021200000221 |
4 | 231323302232222013201133 |
5 | 202434403013033323403 |
6 | 1553355101030502211 |
7 | 60360352002054265 |
oct | 5573625652074137 |
9 | 874260480250027 |
10 | 202021012011103 |
11 | 594086a267006a |
12 | 1a7a9038204967 |
13 | 8895665a820cc |
14 | 37c5c24d52435 |
15 | 185506ba8cdbd |
hex | b7bcaea8785f |
202021012011103 has 4 divisors (see below), whose sum is σ = 202021050949920. Its totient is φ = 202020973072288.
The previous prime is 202021012011061. The next prime is 202021012011109. The reversal of 202021012011103 is 301110210120202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 202021012011103 - 217 = 202021011880031 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202021012011109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10223575 + ... + 22551352.
It is an arithmetic number, because the mean of its divisors is an integer number (50505262737480).
Almost surely, 2202021012011103 is an apocalyptic number.
202021012011103 is a deficient number, since it is larger than the sum of its proper divisors (38938817).
202021012011103 is an equidigital number, since it uses as much as digits as its factorization.
202021012011103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38938816.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 202021012011103 its reverse (301110210120202), we get a palindrome (503131222131305).
The spelling of 202021012011103 in words is "two hundred two trillion, twenty-one billion, twelve million, eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •