Base | Representation |
---|---|
bin | 101101110000000001011001… |
… | …000000001010111110110011 |
3 | 222101102200122200022212011022 |
4 | 231300001121000022332303 |
5 | 202333124411000201321 |
6 | 1551535323343210055 |
7 | 60245044635550244 |
oct | 5560013100127663 |
9 | 871380580285138 |
10 | 201212121100211 |
11 | 59126643854431 |
12 | 1a6983102a692b |
13 | 88372b5b2c020 |
14 | 3798a0bc90ccb |
15 | 183dec7e6bdab |
hex | b7005900afb3 |
201212121100211 has 8 divisors (see below), whose sum is σ = 218793762751200. Its totient is φ = 183931020332352.
The previous prime is 201212121100189. The next prime is 201212121100259. The reversal of 201212121100211 is 112001121212102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201212121100211 - 26 = 201212121100147 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 201212121100211.
It is not an unprimeable number, because it can be changed into a prime (201212121100261) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 75135219386 + ... + 75135222063.
It is an arithmetic number, because the mean of its divisors is an integer number (27349220343900).
Almost surely, 2201212121100211 is an apocalyptic number.
201212121100211 is a deficient number, since it is larger than the sum of its proper divisors (17581641650989).
201212121100211 is a wasteful number, since it uses less digits than its factorization.
201212121100211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150270441565.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 201212121100211 its reverse (112001121212102), we get a palindrome (313213242312313).
The spelling of 201212121100211 in words is "two hundred one trillion, two hundred twelve billion, one hundred twenty-one million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •