Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …110100011111010000010011 |
3 | 111010102122210021102111002111 |
4 | 112300223100310133100103 |
5 | 101110032404333033021 |
6 | 552522121253130151 |
7 | 30041063104205662 |
oct | 2660532064372023 |
9 | 433378707374074 |
10 | 100102011221011 |
11 | 2999402a7533a8 |
12 | b288535029957 |
13 | 43b176b52b297 |
14 | 1aa0d6b00cdd9 |
15 | b88d3a3868e1 |
hex | 5b0ad0d1f413 |
100102011221011 has 8 divisors (see below), whose sum is σ = 105384129219920. Its totient is φ = 94821252331392.
The previous prime is 100102011220957. The next prime is 100102011221027. The reversal of 100102011221011 is 110122110201001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100102011221011 - 217 = 100102011089939 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100102011220982 and 100102011221000.
It is not an unprimeable number, because it can be changed into a prime (100102011221041) 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, 339626130 + ... + 339920743.
It is an arithmetic number, because the mean of its divisors is an integer number (13173016152490).
Almost surely, 2100102011221011 is an apocalyptic number.
100102011221011 is a deficient number, since it is larger than the sum of its proper divisors (5282117998909).
100102011221011 is an equidigital number, since it uses as much as digits as its factorization.
100102011221011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 679554645.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100102011221011 its reverse (110122110201001), we get a palindrome (210224121422012).
The spelling of 100102011221011 in words is "one hundred trillion, one hundred two billion, eleven million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •