Base | Representation |
---|---|
bin | 10110111111010110000010… |
… | …001111000011100100101011 |
3 | 111021000000121110011001202022 |
4 | 112333112002033003210223 |
5 | 101223041300041200021 |
6 | 555013144123255055 |
7 | 30203646210255653 |
oct | 2677260217034453 |
9 | 437000543131668 |
10 | 101110010100011 |
11 | 2a2425728504a0 |
12 | b40b96997a48b |
13 | 445582ca36903 |
14 | 1ad7a7190b363 |
15 | ba5183e761ab |
hex | 5bf5823c392b |
101110010100011 has 32 divisors (see below), whose sum is σ = 113744115850176. Its totient is φ = 89106220800000.
The previous prime is 101110010099971. The next prime is 101110010100017. The reversal of 101110010100011 is 110001010011101.
It is a cyclic number.
It is not a de Polignac number, because 101110010100011 - 210 = 101110010098987 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101110010100017) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6561161 + ... + 15661061.
It is an arithmetic number, because the mean of its divisors is an integer number (3554503620318).
Almost surely, 2101110010100011 is an apocalyptic number.
101110010100011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101110010100011 is a deficient number, since it is larger than the sum of its proper divisors (12634105750165).
101110010100011 is a wasteful number, since it uses less digits than its factorization.
101110010100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9100223.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 101110010100011 its reverse (110001010011101), we get a palindrome (211111020111112).
It can be divided in two parts, 1011100 and 10100011, that added together give a palindrome (11111111).
The spelling of 101110010100011 in words is "one hundred one trillion, one hundred ten billion, ten million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •