Base | Representation |
---|---|
bin | 10001010111000100010… |
… | …101111010100000110101 |
3 | 11020001100020000021122201 |
4 | 101113010111322200311 |
5 | 124021231001120041 |
6 | 2312020122424501 |
7 | 152122436566105 |
oct | 21270425724065 |
9 | 4201306007581 |
10 | 1193000020021 |
11 | 41aa48456577 |
12 | 173265362131 |
13 | 886652bac14 |
14 | 41a549b5205 |
15 | 210753c7631 |
hex | 115c457a835 |
1193000020021 has 4 divisors (see below), whose sum is σ = 1193007740512. Its totient is φ = 1192992299532.
The previous prime is 1193000020007. The next prime is 1193000020031. The reversal of 1193000020021 is 1200200003911.
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 1193000020021 - 25 = 1193000019989 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 (1193000020031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3623625 + ... + 3939118.
It is an arithmetic number, because the mean of its divisors is an integer number (298251935128).
Almost surely, 21193000020021 is an apocalyptic number.
It is an amenable number.
1193000020021 is a deficient number, since it is larger than the sum of its proper divisors (7720491).
1193000020021 is an equidigital number, since it uses as much as digits as its factorization.
1193000020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7720490.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1193000020021 its reverse (1200200003911), we get a palindrome (2393200023932).
The spelling of 1193000020021 in words is "one trillion, one hundred ninety-three billion, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •