Base | Representation |
---|---|
bin | 10000011100011001010… |
… | …000110000100000000011 |
3 | 11000000201122202221220220 |
4 | 100130121100300200003 |
5 | 122003220024102321 |
6 | 2223040454234123 |
7 | 144432313260150 |
oct | 20343120604003 |
9 | 4000648687826 |
10 | 1130000222211 |
11 | 3a6259736a73 |
12 | 163002955943 |
13 | 8273521a553 |
14 | 3c99996d227 |
15 | 1e5d96209c6 |
hex | 10719430803 |
1130000222211 has 8 divisors (see below), whose sum is σ = 1721905100544. Its totient is φ = 645714412680.
The previous prime is 1130000222191. The next prime is 1130000222231. The reversal of 1130000222211 is 1122220000311.
It is an interprime number because it is at equal distance from previous prime (1130000222191) and next prime (1130000222231).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1130000222211 - 25 = 1130000222179 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1130000222231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26904767175 + ... + 26904767216.
It is an arithmetic number, because the mean of its divisors is an integer number (215238137568).
Almost surely, 21130000222211 is an apocalyptic number.
1130000222211 is a deficient number, since it is larger than the sum of its proper divisors (591904878333).
1130000222211 is an equidigital number, since it uses as much as digits as its factorization.
1130000222211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53809534401.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1130000222211 its reverse (1122220000311), we get a palindrome (2252220222522).
The spelling of 1130000222211 in words is "one trillion, one hundred thirty billion, two hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •