Base | Representation |
---|---|
bin | 11110101110000001011… |
… | …010010100000010001001 |
3 | 21110210212020010012222222 |
4 | 132232001122110002021 |
5 | 234041312011213001 |
6 | 4253440254223425 |
7 | 305341356536621 |
oct | 36560132240211 |
9 | 7423766105888 |
10 | 2111000101001 |
11 | 7442a7583650 |
12 | 2a11617b4b75 |
13 | 1240b30053cc |
14 | 7425c809881 |
15 | 39da2cc661b |
hex | 1eb81694089 |
2111000101001 has 8 divisors (see below), whose sum is σ = 2403035688384. Its totient is φ = 1835652261520.
The previous prime is 2111000100997. The next prime is 2111000101033. The reversal of 2111000101001 is 1001010001112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2111000101001 - 22 = 2111000100997 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2111000101001.
It is not an unprimeable number, because it can be changed into a prime (2111003101001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4171936706 + ... + 4171937211.
It is an arithmetic number, because the mean of its divisors is an integer number (300379461048).
Almost surely, 22111000101001 is an apocalyptic number.
It is an amenable number.
2111000101001 is a deficient number, since it is larger than the sum of its proper divisors (292035587383).
2111000101001 is a wasteful number, since it uses less digits than its factorization.
2111000101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8343873951.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 2111000101001 its reverse (1001010001112), we get a palindrome (3112010102113).
The spelling of 2111000101001 in words is "two trillion, one hundred eleven billion, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •