Base | Representation |
---|---|
bin | 1001010010010111011000… |
… | …1111110100011110111011 |
3 | 1100011011200120212102121222 |
4 | 2110211312033310132323 |
5 | 2314244334001334321 |
6 | 33414531351222255 |
7 | 2102505046305233 |
oct | 224456617643673 |
9 | 40134616772558 |
10 | 10211121121211 |
11 | 328756a74018a |
12 | 118ab9797798b |
13 | 590b9b4cc39a |
14 | 27431420ccc3 |
15 | 12a9348ce3ab |
hex | 949763f47bb |
10211121121211 has 8 divisors (see below), whose sum is σ = 10355061024000. Its totient is φ = 10067184587880.
The previous prime is 10211121121163. The next prime is 10211121121213. The reversal of 10211121121211 is 11212112111201.
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 10211121121211 - 238 = 9936243214267 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 10211121121211.
It is not an unprimeable number, because it can be changed into a prime (10211121121213) 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, 5606900 + ... + 7201358.
It is an arithmetic number, because the mean of its divisors is an integer number (1294382628000).
Almost surely, 210211121121211 is an apocalyptic number.
10211121121211 is a deficient number, since it is larger than the sum of its proper divisors (143939902789).
10211121121211 is an equidigital number, since it uses as much as digits as its factorization.
10211121121211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1684729.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 10211121121211 its reverse (11212112111201), we get a palindrome (21423233232412).
The spelling of 10211121121211 in words is "ten trillion, two hundred eleven billion, one hundred twenty-one million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •