Base | Representation |
---|---|
bin | 10110110001001001000100… |
… | …110000010000101111001111 |
3 | 111010112201102002112211022210 |
4 | 112301021010300100233033 |
5 | 101111043433341303403 |
6 | 552544533442441503 |
7 | 30043305250166430 |
oct | 2661110460205717 |
9 | 433481362484283 |
10 | 100134021041103 |
11 | 299a6666430a75 |
12 | b292789063293 |
13 | 43b47a00c842a |
14 | 1aa272634b487 |
15 | b89ab0662b03 |
hex | 5b1244c10bcf |
100134021041103 has 16 divisors (see below), whose sum is σ = 152585599795200. Its totient is φ = 57219281266656.
The previous prime is 100134021041071. The next prime is 100134021041183. The reversal of 100134021041103 is 301140120431001.
It is not a de Polignac number, because 100134021041103 - 25 = 100134021041071 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 100134021041103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100134021041183) 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, 1303573 + ... + 14211521.
It is an arithmetic number, because the mean of its divisors is an integer number (9536599987200).
Almost surely, 2100134021041103 is an apocalyptic number.
100134021041103 is a deficient number, since it is larger than the sum of its proper divisors (52451578754097).
100134021041103 is a wasteful number, since it uses less digits than its factorization.
100134021041103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13277366.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 100134021041103 its reverse (301140120431001), we get a palindrome (401274141472104).
The spelling of 100134021041103 in words is "one hundred trillion, one hundred thirty-four billion, twenty-one million, forty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •