Base | Representation |
---|---|
bin | 10111001111011000100010… |
… | …101001100100100011111011 |
3 | 111101220101120212102102201120 |
4 | 113033120202221210203323 |
5 | 101344121103014030321 |
6 | 1001215350433320323 |
7 | 30346405631520201 |
oct | 2717304251444373 |
9 | 441811525372646 |
10 | 102212213033211 |
11 | 2a627a57654836 |
12 | b5694b34060a3 |
13 | 450575502c648 |
14 | 1b351517b7071 |
15 | bc3b93022ec6 |
hex | 5cf622a648fb |
102212213033211 has 4 divisors (see below), whose sum is σ = 136282950710952. Its totient is φ = 68141475355472.
The previous prime is 102212213033071. The next prime is 102212213033237. The reversal of 102212213033211 is 112330312212201.
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 102212213033211 - 214 = 102212213016827 is a prime.
It is a super-2 number, since 2×1022122130332112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102212213033261) 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, 17035368838866 + ... + 17035368838871.
It is an arithmetic number, because the mean of its divisors is an integer number (34070737677738).
Almost surely, 2102212213033211 is an apocalyptic number.
102212213033211 is a deficient number, since it is larger than the sum of its proper divisors (34070737677741).
102212213033211 is an equidigital number, since it uses as much as digits as its factorization.
102212213033211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34070737677740.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 102212213033211 its reverse (112330312212201), we get a palindrome (214542525245412).
The spelling of 102212213033211 in words is "one hundred two trillion, two hundred twelve billion, two hundred thirteen million, thirty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •