Base | Representation |
---|---|
bin | 10110101111100000110001… |
… | …000010111001110101100110 |
3 | 111010011000022122011010100210 |
4 | 112233200301002321311212 |
5 | 101102230044413442042 |
6 | 552421252054120250 |
7 | 30032231633426556 |
oct | 2657406102716546 |
9 | 433130278133323 |
10 | 100022021234022 |
11 | 29963112466238 |
12 | b274b30650086 |
13 | 43a70614c0c34 |
14 | 1a9b13d71d166 |
15 | b86c07be4a9c |
hex | 5af8310b9d66 |
100022021234022 has 32 divisors (see below), whose sum is σ = 208742287057920. Its totient is φ = 31890975723200.
The previous prime is 100022021233973. The next prime is 100022021234027. The reversal of 100022021234022 is 220432120220001.
It is a super-3 number, since 3×1000220212340223 (a number of 43 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100022021234022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100022021234027) 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, 49320979 + ... + 51308897.
It is an arithmetic number, because the mean of its divisors is an integer number (6523196470560).
Almost surely, 2100022021234022 is an apocalyptic number.
100022021234022 is an abundant number, since it is smaller than the sum of its proper divisors (108720265823898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100022021234022 is a wasteful number, since it uses less digits than its factorization.
100022021234022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2352548.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 100022021234022 its reverse (220432120220001), we get a palindrome (320454141454023).
The spelling of 100022021234022 in words is "one hundred trillion, twenty-two billion, twenty-one million, two hundred thirty-four thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •