Base | Representation |
---|---|
bin | 1001100110011110001110… |
… | …00001000011011111111001 |
3 | 2202202101121110111220210021 |
4 | 10303033013001003133321 |
5 | 10231404113404433142 |
6 | 112523120430450441 |
7 | 4306241244104251 |
oct | 463170701033771 |
9 | 82671543456707 |
10 | 21113103202297 |
11 | 6800020381937 |
12 | 244ba3b663a21 |
13 | ba1c59955c42 |
14 | 52dc45a76961 |
15 | 269300d72267 |
hex | 1333c70437f9 |
21113103202297 has 4 divisors (see below), whose sum is σ = 21562318164096. Its totient is φ = 20663888240500.
The previous prime is 21113103202277. The next prime is 21113103202381. The reversal of 21113103202297 is 79220230131112.
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-21113103202297 is a prime.
It is a super-2 number, since 2×211131032022972 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21113103202277) 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, 224607480829 + ... + 224607480922.
It is an arithmetic number, because the mean of its divisors is an integer number (5390579541024).
Almost surely, 221113103202297 is an apocalyptic number.
It is an amenable number.
21113103202297 is a deficient number, since it is larger than the sum of its proper divisors (449214961799).
21113103202297 is an equidigital number, since it uses as much as digits as its factorization.
21113103202297 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 449214961798.
The product of its (nonzero) digits is 9072, while the sum is 34.
The spelling of 21113103202297 in words is "twenty-one trillion, one hundred thirteen billion, one hundred three million, two hundred two thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •