Base | Representation |
---|---|
bin | 10110101111111011010101… |
… | …100011100000111101000011 |
3 | 111010020201221221000221110201 |
4 | 112233323111203200331003 |
5 | 101103212012032100201 |
6 | 552442331051110031 |
7 | 30034261632032020 |
oct | 2657732543407503 |
9 | 433221857027421 |
10 | 100050551050051 |
11 | 29974222834298 |
12 | b27a573142317 |
13 | 43a995a103094 |
14 | 1a9c6887c6547 |
15 | b87827713801 |
hex | 5afed58e0f43 |
100050551050051 has 8 divisors (see below), whose sum is σ = 114356064644864. Its totient is φ = 85748181887880.
The previous prime is 100050551050027. The next prime is 100050551050097. The reversal of 100050551050051 is 150050155050001.
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 100050551050051 - 211 = 100050551048003 is a prime.
It is a super-2 number, since 2×1000505510500512 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100050351050051) 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, 786039975 + ... + 786167248.
It is an arithmetic number, because the mean of its divisors is an integer number (14294508080608).
Almost surely, 2100050551050051 is an apocalyptic number.
100050551050051 is a deficient number, since it is larger than the sum of its proper divisors (14305513594813).
100050551050051 is an equidigital number, since it uses as much as digits as its factorization.
100050551050051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1572216321.
The product of its (nonzero) digits is 3125, while the sum is 28.
The spelling of 100050551050051 in words is "one hundred trillion, fifty billion, five hundred fifty-one million, fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •