Base | Representation |
---|---|
bin | 10110101111111010110100… |
… | …101101011101111100111111 |
3 | 111010020200112112011021002121 |
4 | 112233322310231131330333 |
5 | 101103204400000323241 |
6 | 552442200244303411 |
7 | 30034242161212255 |
oct | 2657726455357477 |
9 | 433220475137077 |
10 | 100050000011071 |
11 | 29973a6a787580 |
12 | b27a43a6a1b67 |
13 | 43a989cbbaa06 |
14 | 1a9c6355465d5 |
15 | b877e4167ad1 |
hex | 5afeb4b5df3f |
100050000011071 has 8 divisors (see below), whose sum is σ = 109169801132544. Its totient is φ = 90934256652120.
The previous prime is 100050000011047. The next prime is 100050000011099. The reversal of 100050000011071 is 170110000050001.
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 100050000011071 - 233 = 100041410076479 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100050000011041) 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, 1014389071 + ... + 1014487696.
It is an arithmetic number, because the mean of its divisors is an integer number (13646225141568).
Almost surely, 2100050000011071 is an apocalyptic number.
100050000011071 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100050000011071 is a deficient number, since it is larger than the sum of its proper divisors (9119801121473).
100050000011071 is a wasteful number, since it uses less digits than its factorization.
100050000011071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2028881261.
The product of its (nonzero) digits is 35, while the sum is 16.
Adding to 100050000011071 its reverse (170110000050001), we get a palindrome (270160000061072).
The spelling of 100050000011071 in words is "one hundred trillion, fifty billion, eleven thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •