Base | Representation |
---|---|
bin | 10000000010100000111… |
… | …001010010011110010101 |
3 | 10220100222222110012211112 |
4 | 100002200321102132111 |
5 | 121024312004001323 |
6 | 2202203154544405 |
7 | 142426546630211 |
oct | 20024071223625 |
9 | 3810888405745 |
10 | 1102211000213 |
11 | 3954994141a4 |
12 | 159748298105 |
13 | 7cc26b8b81b |
14 | 3b4c0da9941 |
15 | 1da0eb42178 |
hex | 100a0e52795 |
1102211000213 has 8 divisors (see below), whose sum is σ = 1167057624600. Its totient is φ = 1037365562880.
The previous prime is 1102211000203. The next prime is 1102211000227. The reversal of 1102211000213 is 3120001122011.
It can be written as a sum of positive squares in 4 ways, for example, as 694358891524 + 407852108689 = 833282^2 + 638633^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1102211000213 - 234 = 1085031131029 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 (1102211000203) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2229353 + ... + 2678513.
It is an arithmetic number, because the mean of its divisors is an integer number (145882203075).
Almost surely, 21102211000213 is an apocalyptic number.
It is an amenable number.
1102211000213 is a deficient number, since it is larger than the sum of its proper divisors (64846624387).
1102211000213 is a wasteful number, since it uses less digits than its factorization.
1102211000213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 593527.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1102211000213 its reverse (3120001122011), we get a palindrome (4222212122224).
The spelling of 1102211000213 in words is "one trillion, one hundred two billion, two hundred eleven million, two hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •