Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …110011101011101111011011 |
3 | 111010102122210021000202122200 |
4 | 112300223100303223233123 |
5 | 101110032404304310021 |
6 | 552522121244421243 |
7 | 30041063102336553 |
oct | 2660532063535733 |
9 | 433378707022580 |
10 | 100102011010011 |
11 | 2999402a61991a |
12 | b288534b47823 |
13 | 43b176b48622a |
14 | 1aa0d6ad96163 |
15 | b88d3a344126 |
hex | 5b0ad0cebbdb |
100102011010011 has 12 divisors (see below), whose sum is σ = 144613507507560. Its totient is φ = 66724652240640.
The previous prime is 100102011010009. The next prime is 100102011010021. The reversal of 100102011010011 is 110010110201001.
It is not a de Polignac number, because 100102011010011 - 21 = 100102011010009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100102011009975 and 100102011010002.
It is not an unprimeable number, because it can be changed into a prime (100102011010021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 835083910 + ... + 835203771.
It is an arithmetic number, because the mean of its divisors is an integer number (12051125625630).
Almost surely, 2100102011010011 is an apocalyptic number.
100102011010011 is a deficient number, since it is larger than the sum of its proper divisors (44511496497549).
100102011010011 is a wasteful number, since it uses less digits than its factorization.
100102011010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1670294346 (or 1670294343 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100102011010011 its reverse (110010110201001), we get a palindrome (210112121211012).
The spelling of 100102011010011 in words is "one hundred trillion, one hundred two billion, eleven million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •