Base | Representation |
---|---|
bin | 10110110010011011000001… |
… | …011011001010111011011001 |
3 | 111010212010112100002012011012 |
4 | 112302123001123022323121 |
5 | 101114014140033311301 |
6 | 553053205014343305 |
7 | 30052541613116144 |
oct | 2662330133127331 |
9 | 433763470065135 |
10 | 100222012010201 |
11 | 29a2aa09aa7444 |
12 | b2a784505ab35 |
13 | 43bcb83930913 |
14 | 1aa6ab24bd05b |
15 | b8c010445ebb |
hex | 5b26c16caed9 |
100222012010201 has 4 divisors (see below), whose sum is σ = 105496854747600. Its totient is φ = 94947169272804.
The previous prime is 100222012010147. The next prime is 100222012010233. The reversal of 100222012010201 is 102010210222001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100222012010201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100222012010291) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2637421368671 + ... + 2637421368708.
It is an arithmetic number, because the mean of its divisors is an integer number (26374213686900).
Almost surely, 2100222012010201 is an apocalyptic number.
It is an amenable number.
100222012010201 is a deficient number, since it is larger than the sum of its proper divisors (5274842737399).
100222012010201 is an equidigital number, since it uses as much as digits as its factorization.
100222012010201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5274842737398.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 100222012010201 its reverse (102010210222001), we get a palindrome (202232222232202).
The spelling of 100222012010201 in words is "one hundred trillion, two hundred twenty-two billion, twelve million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •