Base | Representation |
---|---|
bin | 10110110010011011000111… |
… | …111111001011000000101101 |
3 | 111010212010211000020220002100 |
4 | 112302123013333023000231 |
5 | 101114014401230023041 |
6 | 553053223550245313 |
7 | 30052544421010611 |
oct | 2662330777130055 |
9 | 433763730226070 |
10 | 100222122111021 |
11 | 29a2aa66167859 |
12 | b2a7875ab6839 |
13 | 43bcba069cb31 |
14 | 1aa6ac2d7d341 |
15 | b8c019e436b6 |
hex | 5b26c7fcb02d |
100222122111021 has 24 divisors (see below), whose sum is σ = 155259692658720. Its totient is φ = 62103877052256.
The previous prime is 100222122111011. The next prime is 100222122111029. The reversal of 100222122111021 is 120111221222001.
It is not a de Polignac number, because 100222122111021 - 223 = 100222113722413 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100222122110985 and 100222122111003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100222122111029) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5529182271 + ... + 5529200396.
It is an arithmetic number, because the mean of its divisors is an integer number (6469153860780).
Almost surely, 2100222122111021 is an apocalyptic number.
It is an amenable number.
100222122111021 is a deficient number, since it is larger than the sum of its proper divisors (55037570547699).
100222122111021 is a wasteful number, since it uses less digits than its factorization.
100222122111021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11058382745 (or 11058382742 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 100222122111021 its reverse (120111221222001), we get a palindrome (220333343333022).
The spelling of 100222122111021 in words is "one hundred trillion, two hundred twenty-two billion, one hundred twenty-two million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •