Base | Representation |
---|---|
bin | 11101001000100000100… |
… | …00011000100000010101 |
3 | 10112200202102022021121220 |
4 | 32210100100120200111 |
5 | 112400022012010401 |
6 | 2043504134200553 |
7 | 132214500355635 |
oct | 16442020304025 |
9 | 3480672267556 |
10 | 1001000110101 |
11 | 356581514472 |
12 | 142000ab3159 |
13 | 73517543b74 |
14 | 3663d1c26c5 |
15 | 1b08946a336 |
hex | e910418815 |
1001000110101 has 24 divisors (see below), whose sum is σ = 1370025697920. Its totient is φ = 649815866112.
The previous prime is 1001000110087. The next prime is 1001000110129. The reversal of 1001000110101 is 1010110001001.
It is not a de Polignac number, because 1001000110101 - 29 = 1001000109589 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1001000110101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001000110151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5380605 + ... + 5563533.
It is an arithmetic number, because the mean of its divisors is an integer number (57084404080).
Almost surely, 21001000110101 is an apocalyptic number.
It is an amenable number.
1001000110101 is a deficient number, since it is larger than the sum of its proper divisors (369025587819).
1001000110101 is an equidigital number, since it uses as much as digits as its factorization.
1001000110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183373 (or 183176 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 1001000110101 its reverse (1010110001001), we get a palindrome (2011110111102).
The spelling of 1001000110101 in words is "one trillion, one billion, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •