Base | Representation |
---|---|
bin | 10111001111011000101001… |
… | …110100000011110100110101 |
3 | 111101220101220020120201102102 |
4 | 113033120221310003310311 |
5 | 101344121324301120341 |
6 | 1001215410405351445 |
7 | 30346411621232324 |
oct | 2717305164036465 |
9 | 441811806521372 |
10 | 102212333223221 |
11 | 2a628009486321 |
12 | b569527708585 |
13 | 4505773bc1bb0 |
14 | 1b351637420bb |
15 | bc3b9d864c9b |
hex | 5cf629d03d35 |
102212333223221 has 16 divisors (see below), whose sum is σ = 110102212277568. Its totient is φ = 94326370320000.
The previous prime is 102212333222971. The next prime is 102212333223223. The reversal of 102212333223221 is 122322333212201.
It is a de Polignac number, because none of the positive numbers 2k-102212333223221 is a prime.
It is a super-2 number, since 2×1022123332232212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102212333223223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 940200950 + ... + 940309656.
It is an arithmetic number, because the mean of its divisors is an integer number (6881388267348).
Almost surely, 2102212333223221 is an apocalyptic number.
It is an amenable number.
102212333223221 is a deficient number, since it is larger than the sum of its proper divisors (7889879054347).
102212333223221 is a wasteful number, since it uses less digits than its factorization.
102212333223221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126052.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 102212333223221 its reverse (122322333212201), we get a palindrome (224534666435422).
The spelling of 102212333223221 in words is "one hundred two trillion, two hundred twelve billion, three hundred thirty-three million, two hundred twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •