Base | Representation |
---|---|
bin | 10110110010011011000001… |
… | …111101100011000110011110 |
3 | 111010212010112222001001011121 |
4 | 112302123001331203012132 |
5 | 101114014144340201420 |
6 | 553053205535441154 |
7 | 30052542052532011 |
oct | 2662330175430636 |
9 | 433763488031147 |
10 | 100222021022110 |
11 | 29a2aa140a21a9 |
12 | b2a78480861ba |
13 | 43bcb85767800 |
14 | 1aa6ab3787378 |
15 | b8c0111262aa |
hex | 5b26c1f6319e |
100222021022110 has 96 divisors (see below), whose sum is σ = 205656503182560. Its totient is φ = 35052090937344.
The previous prime is 100222021022089. The next prime is 100222021022113. The reversal of 100222021022110 is 11220120222001.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100222021022113) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 214036162 + ... + 214503898.
It is an arithmetic number, because the mean of its divisors is an integer number (2142255241485).
Almost surely, 2100222021022110 is an apocalyptic number.
100222021022110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100222021022110 is an abundant number, since it is smaller than the sum of its proper divisors (105434482160450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100222021022110 is a wasteful number, since it uses less digits than its factorization.
100222021022110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 474462 (or 474449 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 100222021022110 its reverse (11220120222001), we get a palindrome (111442141244111).
The spelling of 100222021022110 in words is "one hundred trillion, two hundred twenty-two billion, twenty-one million, twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •