Base | Representation |
---|---|
bin | 10110110001001001000100… |
… | …010101110111010010001101 |
3 | 111010112201101121112020212102 |
4 | 112301021010111313102031 |
5 | 101111043430103333401 |
6 | 552544533034244445 |
7 | 30043305134315462 |
oct | 2661110425672215 |
9 | 433481347466772 |
10 | 100134014121101 |
11 | 299a6662534964 |
12 | b292786886725 |
13 | 43b479b84475c |
14 | 1aa2725469669 |
15 | b89aaec4756b |
hex | 5b124457748d |
100134014121101 has 8 divisors (see below), whose sum is σ = 100224058003200. Its totient is φ = 100043972632800.
The previous prime is 100134014121083. The next prime is 100134014121103. The reversal of 100134014121101 is 101121410431001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100134014121101 - 226 = 100133947012237 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100134014121103) 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, 89142020 + ... + 90258338.
It is an arithmetic number, because the mean of its divisors is an integer number (12528007250400).
Almost surely, 2100134014121101 is an apocalyptic number.
It is an amenable number.
100134014121101 is a deficient number, since it is larger than the sum of its proper divisors (90043882099).
100134014121101 is a wasteful number, since it uses less digits than its factorization.
100134014121101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1196899.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 100134014121101 its reverse (101121410431001), we get a palindrome (201255424552102).
The spelling of 100134014121101 in words is "one hundred trillion, one hundred thirty-four billion, fourteen million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •