Base | Representation |
---|---|
bin | 101111111110011111000010… |
… | …011110110101000011001111 |
3 | 1000200002121100121201110212100 |
4 | 233332133002132311003033 |
5 | 210124024321012241421 |
6 | 2024433011502010143 |
7 | 62305254156513045 |
oct | 5776370236650317 |
9 | 1020077317643770 |
10 | 211002121212111 |
11 | 61260551679319 |
12 | 1b7b975b576953 |
13 | 9097550cb9b18 |
14 | 3a167b2ba8395 |
15 | 195d9b1aa0c26 |
hex | bfe7c27b50cf |
211002121212111 has 24 divisors (see below), whose sum is σ = 306208880490240. Its totient is φ = 140009573720016.
The previous prime is 211002121211923. The next prime is 211002121212137. The reversal of 211002121212111 is 111212121200112.
It is a happy number.
211002121212111 is a `hidden beast` number, since 21 + 100 + 212 + 121 + 211 + 1 = 666.
It is not a de Polignac number, because 211002121212111 - 213 = 211002121203919 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211002121212811) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20178541 + ... + 28795446.
It is an arithmetic number, because the mean of its divisors is an integer number (12758703353760).
Almost surely, 2211002121212111 is an apocalyptic number.
211002121212111 is a deficient number, since it is larger than the sum of its proper divisors (95206759278129).
211002121212111 is a wasteful number, since it uses less digits than its factorization.
211002121212111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48976235 (or 48976232 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 211002121212111 its reverse (111212121200112), we get a palindrome (322214242412223).
The spelling of 211002121212111 in words is "two hundred eleven trillion, two billion, one hundred twenty-one million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •