Base | Representation |
---|---|
bin | 10110110000110010110100… |
… | …010001000111101111101100 |
3 | 111010110102201112111221211222 |
4 | 112300302310101013233230 |
5 | 101110201012230402340 |
6 | 552525542154002512 |
7 | 30041501102553200 |
oct | 2660626421075754 |
9 | 433412645457758 |
10 | 100110122122220 |
11 | 29997512088541 |
12 | b28a019416438 |
13 | 43b2461a30a02 |
14 | 1aa14da304b00 |
15 | b8916248b8b5 |
hex | 5b0cb4447bec |
100110122122220 has 72 divisors (see below), whose sum is σ = 245968338453264. Its totient is φ = 34125068820864.
The previous prime is 100110122122193. The next prime is 100110122122253. The reversal of 100110122122220 is 22221221011001.
It is a super-4 number, since 4×1001101221222204 (a number of 57 digits) contains 4444 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 295070882 + ... + 295409961.
It is an arithmetic number, because the mean of its divisors is an integer number (3416226922962).
Almost surely, 2100110122122220 is an apocalyptic number.
100110122122220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100110122122220 is an abundant number, since it is smaller than the sum of its proper divisors (145858216331044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100110122122220 is a wasteful number, since it uses less digits than its factorization.
100110122122220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 590481039 (or 590481030 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 100110122122220 its reverse (22221221011001), we get a palindrome (122331343133221).
The spelling of 100110122122220 in words is "one hundred trillion, one hundred ten billion, one hundred twenty-two million, one hundred twenty-two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •