Base | Representation |
---|---|
bin | 10110101111011111111011… |
… | …011100111110101110000111 |
3 | 111010010220222222021101111112 |
4 | 112233133323130332232013 |
5 | 101102221224224200403 |
6 | 552421022534355235 |
7 | 30032200435056101 |
oct | 2657377334765607 |
9 | 433126888241445 |
10 | 100021122100103 |
11 | 299627a0975656 |
12 | b27491b4bbb1b |
13 | 43a6c4a13b829 |
14 | 1a9b09614a571 |
15 | b86ba3cd99d8 |
hex | 5af7fb73eb87 |
100021122100103 has 16 divisors (see below), whose sum is σ = 101543661158400. Its totient is φ = 98501787384000.
The previous prime is 100021122100069. The next prime is 100021122100127. The reversal of 100021122100103 is 301001221120001.
It is a cyclic number.
It is not a de Polignac number, because 100021122100103 - 234 = 100003942230919 is a prime.
It is a super-3 number, since 3×1000211221001033 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100021122100903) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 327303323 + ... + 327608771.
It is an arithmetic number, because the mean of its divisors is an integer number (6346478822400).
Almost surely, 2100021122100103 is an apocalyptic number.
100021122100103 is a deficient number, since it is larger than the sum of its proper divisors (1522539058297).
100021122100103 is a wasteful number, since it uses less digits than its factorization.
100021122100103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310678.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 100021122100103 its reverse (301001221120001), we get a palindrome (401022343220104).
The spelling of 100021122100103 in words is "one hundred trillion, twenty-one billion, one hundred twenty-two million, one hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •