Base | Representation |
---|---|
bin | 10110110010011011000110… |
… | …110111000101100101001101 |
3 | 111010212010202200200211210222 |
4 | 112302123012313011211031 |
5 | 101114014331410330123 |
6 | 553053222033241125 |
7 | 30052544101255505 |
oct | 2662330667054515 |
9 | 433763680624728 |
10 | 100222103214413 |
11 | 29a2aa56530524 |
12 | b2a786b7031a5 |
13 | 43bcb997b49cb |
14 | 1aa6ac0660a05 |
15 | b8c01845e6c8 |
hex | 5b26c6dc594d |
100222103214413 has 2 divisors, whose sum is σ = 100222103214414. Its totient is φ = 100222103214412.
The previous prime is 100222103214403. The next prime is 100222103214437. The reversal of 100222103214413 is 314412301222001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98939984072164 + 1282119142249 = 9946858^2 + 1132307^2 .
It is a cyclic number.
It is not a de Polignac number, because 100222103214413 - 214 = 100222103198029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100222103214403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50111051607206 + 50111051607207.
It is an arithmetic number, because the mean of its divisors is an integer number (50111051607207).
Almost surely, 2100222103214413 is an apocalyptic number.
It is an amenable number.
100222103214413 is a deficient number, since it is larger than the sum of its proper divisors (1).
100222103214413 is an equidigital number, since it uses as much as digits as its factorization.
100222103214413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 100222103214413 its reverse (314412301222001), we get a palindrome (414634404436414).
The spelling of 100222103214413 in words is "one hundred trillion, two hundred twenty-two billion, one hundred three million, two hundred fourteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •