Base | Representation |
---|---|
bin | 10111001111100000101111… |
… | …100110010010100000010101 |
3 | 111101221020022122200102200201 |
4 | 113033200233212102200111 |
5 | 101344242122133224341 |
6 | 1001223404405540501 |
7 | 30350140113351052 |
oct | 2717405746224025 |
9 | 441836278612621 |
10 | 102221020211221 |
11 | 2a630767015a4a |
12 | b56b150a14731 |
13 | 4506529869892 |
14 | 1b35749358029 |
15 | bc400b312331 |
hex | 5cf82f992815 |
102221020211221 has 16 divisors (see below), whose sum is σ = 106549824061440. Its totient is φ = 98001905142960.
The previous prime is 102221020211197. The next prime is 102221020211291. The reversal of 102221020211221 is 122112020122201.
It is a cyclic number.
It is not a de Polignac number, because 102221020211221 - 211 = 102221020209173 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 (102221020211291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107916535 + ... + 108859636.
It is an arithmetic number, because the mean of its divisors is an integer number (6659364003840).
Almost surely, 2102221020211221 is an apocalyptic number.
It is an amenable number.
102221020211221 is a deficient number, since it is larger than the sum of its proper divisors (4328803850219).
102221020211221 is a wasteful number, since it uses less digits than its factorization.
102221020211221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216776424.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 102221020211221 its reverse (122112020122201), we get a palindrome (224333040333422).
The spelling of 102221020211221 in words is "one hundred two trillion, two hundred twenty-one billion, twenty million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •