Base | Representation |
---|---|
bin | 101111111110101000010111… |
… | …000111001011110110101011 |
3 | 1000200010120012012220222220222 |
4 | 233332220113013023312223 |
5 | 210124210321014341021 |
6 | 2024441345034440255 |
7 | 62306060213432120 |
oct | 5776502707136653 |
9 | 1020116165828828 |
10 | 211012131012011 |
11 | 6126481897711a |
12 | 1b7bb69389308b |
13 | 9098487a28a44 |
14 | 3a1708235c747 |
15 | 195dd9a7476ab |
hex | bfea171cbdab |
211012131012011 has 4 divisors (see below), whose sum is σ = 241156721156592. Its totient is φ = 180867540867432.
The previous prime is 211012131011999. The next prime is 211012131012031. The reversal of 211012131012011 is 110210131210112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211012131012011 - 210 = 211012131010987 is a prime.
It is a super-2 number, since 2×2110121310120112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211012131012031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15072295072280 + ... + 15072295072293.
It is an arithmetic number, because the mean of its divisors is an integer number (60289180289148).
Almost surely, 2211012131012011 is an apocalyptic number.
211012131012011 is a deficient number, since it is larger than the sum of its proper divisors (30144590144581).
211012131012011 is an equidigital number, since it uses as much as digits as its factorization.
211012131012011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30144590144580.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 211012131012011 its reverse (110210131210112), we get a palindrome (321222262222123).
The spelling of 211012131012011 in words is "two hundred eleven trillion, twelve billion, one hundred thirty-one million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •