Base | Representation |
---|---|
bin | 10000000010010100111… |
… | …111001100000011110101 |
3 | 10220100111001112100012021 |
4 | 100002110333030003311 |
5 | 121023404333021323 |
6 | 2202131300553141 |
7 | 142421602550221 |
oct | 20022477140365 |
9 | 3810431470167 |
10 | 1102011220213 |
11 | 3953a6671562 |
12 | 1596b13b27b1 |
13 | 7cbc46806c7 |
14 | 3b4a2643781 |
15 | 1d9ec32d05d |
hex | 10094fcc0f5 |
1102011220213 has 4 divisors (see below), whose sum is σ = 1105487596620. Its totient is φ = 1098534843808.
The previous prime is 1102011220151. The next prime is 1102011220237. The reversal of 1102011220213 is 3120221102011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 320312985444 + 781698234769 = 565962^2 + 884137^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102011220213 - 213 = 1102011212021 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 (1102011229213) 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, 1738187728 + ... + 1738188361.
It is an arithmetic number, because the mean of its divisors is an integer number (276371899155).
Almost surely, 21102011220213 is an apocalyptic number.
It is an amenable number.
1102011220213 is a deficient number, since it is larger than the sum of its proper divisors (3476376407).
1102011220213 is an equidigital number, since it uses as much as digits as its factorization.
1102011220213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3476376406.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1102011220213 its reverse (3120221102011), we get a palindrome (4222232322224).
The spelling of 1102011220213 in words is "one trillion, one hundred two billion, eleven million, two hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •