Base | Representation |
---|---|
bin | 1010001101001001111001… |
… | …0001101011100011011010 |
3 | 1110201201122110011002102122 |
4 | 2203102132101223203122 |
5 | 2432321313130341442 |
6 | 35510523510301242 |
7 | 2235461365240223 |
oct | 243223621534332 |
9 | 43651573132378 |
10 | 11221110012122 |
11 | 363693408271a |
12 | 1312887057822 |
13 | 6351b9095a5a |
14 | 2ab16712624a |
15 | 146d4805bdd2 |
hex | a349e46b8da |
11221110012122 has 8 divisors (see below), whose sum is σ = 16831690601076. Its totient is φ = 5610546478432.
The previous prime is 11221110012121. The next prime is 11221110012163. The reversal of 11221110012122 is 22121001112211.
11221110012122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 11077507667521 + 143602344601 = 3328289^2 + 378949^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11221110012122.
It is not an unprimeable number, because it can be changed into a prime (11221110012121) 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, 2467673 + ... + 5341500.
Almost surely, 211221110012122 is an apocalyptic number.
11221110012122 is a deficient number, since it is larger than the sum of its proper divisors (5610580588954).
11221110012122 is an equidigital number, since it uses as much as digits as its factorization.
11221110012122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8527632.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11221110012122 its reverse (22121001112211), we get a palindrome (33342111124333).
The spelling of 11221110012122 in words is "eleven trillion, two hundred twenty-one billion, one hundred ten million, twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •