Base | Representation |
---|---|
bin | 11101011001010001011… |
… | …00010001111101011101 |
3 | 10120112222122012121211120 |
4 | 32230220230101331131 |
5 | 113021440000323401 |
6 | 2051553153241153 |
7 | 132653512305234 |
oct | 16545054217535 |
9 | 3515878177746 |
10 | 1010000011101 |
11 | 35a37a748284 |
12 | 1438b2b631b9 |
13 | 7431cc8b083 |
14 | 36c545adb1b |
15 | 1b414627836 |
hex | eb28b11f5d |
1010000011101 has 8 divisors (see below), whose sum is σ = 1350182784000. Its totient is φ = 671575289472.
The previous prime is 1010000011021. The next prime is 1010000011117. The reversal of 1010000011101 is 1011100000101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1010000011101 - 218 = 1009999748957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1010000011101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010000031101) 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, 439511476 + ... + 439513773.
It is an arithmetic number, because the mean of its divisors is an integer number (168772848000).
Almost surely, 21010000011101 is an apocalyptic number.
It is an amenable number.
1010000011101 is a deficient number, since it is larger than the sum of its proper divisors (340182772899).
1010000011101 is an equidigital number, since it uses as much as digits as its factorization.
1010000011101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 879025635.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 1010000011101 its reverse (1011100000101), we get a palindrome (2021100011202).
It can be divided in two parts, 10100000 and 11101, that added together give a palindrome (10111101).
The spelling of 1010000011101 in words is "one trillion, ten billion, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •