Base | Representation |
---|---|
bin | 11101101110010101101… |
… | …00111001010110111011 |
3 | 10121122011212011100012022 |
4 | 32313022310321112323 |
5 | 113213120342110321 |
6 | 2101103340105055 |
7 | 133534005503663 |
oct | 16671264712673 |
9 | 3548155140168 |
10 | 1021310113211 |
11 | 364153a2a403 |
12 | 145b2a83518b |
13 | 7540320c69b |
14 | 376087231a3 |
15 | 1b87751ddab |
hex | edcad395bb |
1021310113211 has 8 divisors (see below), whose sum is σ = 1082471837760. Its totient is φ = 960268906368.
The previous prime is 1021310113193. The next prime is 1021310113217. The reversal of 1021310113211 is 1123110131201.
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 1021310113211 - 226 = 1021243004347 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
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 1021310113211.
It is not an unprimeable number, because it can be changed into a prime (1021310113217) 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, 30111971 + ... + 30145868.
It is an arithmetic number, because the mean of its divisors is an integer number (135308979720).
Almost surely, 21021310113211 is an apocalyptic number.
1021310113211 is a deficient number, since it is larger than the sum of its proper divisors (61161724549).
1021310113211 is an equidigital number, since it uses as much as digits as its factorization.
1021310113211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60258853.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 1021310113211 its reverse (1123110131201), we get a palindrome (2144420244412).
The spelling of 1021310113211 in words is "one trillion, twenty-one billion, three hundred ten million, one hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •