Base | Representation |
---|---|
bin | 101111111110011111000010… |
… | …011110000011111110100111 |
3 | 1000200002121100121100021010220 |
4 | 233332133002132003332213 |
5 | 210124024320434323421 |
6 | 2024433011453415423 |
7 | 62305254155015043 |
oct | 5776370236037647 |
9 | 1020077317307126 |
10 | 211002121011111 |
11 | 61260551551301 |
12 | 1b7b975b49a573 |
13 | 9097550c494a1 |
14 | 3a167b2b55023 |
15 | 195d9b1a613c6 |
hex | bfe7c2783fa7 |
211002121011111 has 8 divisors (see below), whose sum is σ = 281946435018864. Its totient is φ = 140362943838720.
The previous prime is 211002121011061. The next prime is 211002121011167. The reversal of 211002121011111 is 111110121200112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211002121011111 - 222 = 211002116816807 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211002121011191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76284207226 + ... + 76284209991.
It is an arithmetic number, because the mean of its divisors is an integer number (35243304377358).
Almost surely, 2211002121011111 is an apocalyptic number.
211002121011111 is a deficient number, since it is larger than the sum of its proper divisors (70944314007753).
211002121011111 is a wasteful number, since it uses less digits than its factorization.
211002121011111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152568417681.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 211002121011111 its reverse (111110121200112), we get a palindrome (322112242211223).
The spelling of 211002121011111 in words is "two hundred eleven trillion, two billion, one hundred twenty-one million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •