Base | Representation |
---|---|
bin | 1001001100011111000110… |
… | …0101001011000001001001 |
3 | 1022210111222000200202010100 |
4 | 2103013301211023001021 |
5 | 2311121001420213001 |
6 | 33300304304040013 |
7 | 2062300656303342 |
oct | 223076145130111 |
9 | 38714860622110 |
10 | 10110111101001 |
11 | 3248746167a3a |
12 | 11734a7903009 |
13 | 5844c1684962 |
14 | 26d490d930c9 |
15 | 127ec1b84586 |
hex | 931f194b049 |
10110111101001 has 48 divisors (see below), whose sum is σ = 15790904833600. Its totient is φ = 6211440837504.
The previous prime is 10110111100981. The next prime is 10110111101009. The reversal of 10110111101001 is 10010111101101.
It is not a de Polignac number, because 10110111101001 - 211 = 10110111098953 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10110111101009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 30133170 + ... + 30466836.
Almost surely, 210110111101001 is an apocalyptic number.
It is an amenable number.
10110111101001 is a deficient number, since it is larger than the sum of its proper divisors (5680793732599).
10110111101001 is a wasteful number, since it uses less digits than its factorization.
10110111101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338518 (or 338515 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10110111101001 its reverse (10010111101101), we get a palindrome (20120222202102).
It can be divided in two parts, 10110 and 111101001, that added together give a palindrome (111111111).
The spelling of 10110111101001 in words is "ten trillion, one hundred ten billion, one hundred eleven million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •