Base | Representation |
---|---|
bin | 10111001111010110101011… |
… | …111111001011111111001101 |
3 | 111101220012110010100012002101 |
4 | 113033112223333023333031 |
5 | 101344103013341223041 |
6 | 1001214421115155101 |
7 | 30346305406021651 |
oct | 2717265377137715 |
9 | 441805403305071 |
10 | 102210222211021 |
11 | 2a627125906641 |
12 | b569038745a91 |
13 | 45054c8749852 |
14 | 1b3500322aa61 |
15 | bc3ac8374b31 |
hex | 5cf5abfcbfcd |
102210222211021 has 32 divisors (see below), whose sum is σ = 116584032208896. Its totient is φ = 89036961024000.
The previous prime is 102210222210997. The next prime is 102210222211099. The reversal of 102210222211021 is 120112222012201.
It is a cyclic number.
It is not a de Polignac number, because 102210222211021 - 211 = 102210222208973 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102210222211021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102210222211421) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 106928361 + ... + 107880001.
It is an arithmetic number, because the mean of its divisors is an integer number (3643251006528).
Almost surely, 2102210222211021 is an apocalyptic number.
It is an amenable number.
102210222211021 is a deficient number, since it is larger than the sum of its proper divisors (14373809997875).
102210222211021 is a wasteful number, since it uses less digits than its factorization.
102210222211021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 960573.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 102210222211021 its reverse (120112222012201), we get a palindrome (222322444223222).
The spelling of 102210222211021 in words is "one hundred two trillion, two hundred ten billion, two hundred twenty-two million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •