Base | Representation |
---|---|
bin | 10110110010011001011100… |
… | …100100101010110001001111 |
3 | 111010211222011102021020000120 |
4 | 112302121130210222301033 |
5 | 101114002203410013403 |
6 | 553052325053000023 |
7 | 30052451646225051 |
oct | 2662313444526117 |
9 | 433758142236016 |
10 | 100220320001103 |
11 | 29a2a2209a1a15 |
12 | b2a7452483013 |
13 | 43bc9742215c3 |
14 | 1aa69918b78d1 |
15 | b8be61b1ee53 |
hex | 5b265c92ac4f |
100220320001103 has 8 divisors (see below), whose sum is σ = 133682934169008. Its totient is φ = 66785626250304.
The previous prime is 100220320001089. The next prime is 100220320001107. The reversal of 100220320001103 is 301100023022001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100220320001103 - 213 = 100220319992911 is a prime.
It is a super-2 number, since 2×1002203200011032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100220320001107) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6980095900 + ... + 6980110257.
It is an arithmetic number, because the mean of its divisors is an integer number (16710366771126).
Almost surely, 2100220320001103 is an apocalyptic number.
100220320001103 is a deficient number, since it is larger than the sum of its proper divisors (33462614167905).
100220320001103 is a wasteful number, since it uses less digits than its factorization.
100220320001103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13960208553.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 100220320001103 its reverse (301100023022001), we get a palindrome (401320343023104).
The spelling of 100220320001103 in words is "one hundred trillion, two hundred twenty billion, three hundred twenty million, one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •