Base | Representation |
---|---|
bin | 10110110010011011001101… |
… | …010110111000001000001100 |
3 | 111010212011001021210110022110 |
4 | 112302123031112320020030 |
5 | 101114020042311224322 |
6 | 553053240525344020 |
7 | 30052546563601440 |
oct | 2662331526701014 |
9 | 433764037713273 |
10 | 100222212211212 |
11 | 29a30002007423 |
12 | b2a78a0108010 |
13 | 43bcbb6258560 |
14 | 1aa6ad0d14820 |
15 | b8c022cdec0c |
hex | 5b26cd5b820c |
100222212211212 has 96 divisors (see below), whose sum is σ = 300331445363712. Its totient is φ = 25283004316416.
The previous prime is 100222212211207. The next prime is 100222212211237. The reversal of 100222212211212 is 212112212222001.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1995161463 + ... + 1995211694.
It is an arithmetic number, because the mean of its divisors is an integer number (3128452555872).
Almost surely, 2100222212211212 is an apocalyptic number.
100222212211212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100222212211212 is an abundant number, since it is smaller than the sum of its proper divisors (200109233152500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100222212211212 is a wasteful number, since it uses less digits than its factorization.
100222212211212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3990373207 (or 3990373205 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 100222212211212 its reverse (212112212222001), we get a palindrome (312334424433213).
The spelling of 100222212211212 in words is "one hundred trillion, two hundred twenty-two billion, two hundred twelve million, two hundred eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •