Base | Representation |
---|---|
bin | 1010000110001011010001… |
… | …1101011111000010000111 |
3 | 1110022021012022211000012001 |
4 | 2201202310131133002013 |
5 | 2423340301104333111 |
6 | 35335455334210131 |
7 | 2224015441415341 |
oct | 241426435370207 |
9 | 43267168730161 |
10 | 11101223121031 |
11 | 35a0003052a3a |
12 | 12b35a91b3947 |
13 | 626ac1461b44 |
14 | 2a5432c24291 |
15 | 143b7ce9a1c1 |
hex | a18b475f087 |
11101223121031 has 8 divisors (see below), whose sum is σ = 11235102165504. Its totient is φ = 10967347156920.
The previous prime is 11101223121013. The next prime is 11101223121041. The reversal of 11101223121031 is 13012132210111.
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 11101223121031 - 217 = 11101222989959 is a prime.
It is a super-2 number, since 2×111012231210312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101223121041) 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, 6944266 + ... + 8391976.
It is an arithmetic number, because the mean of its divisors is an integer number (1404387770688).
Almost surely, 211101223121031 is an apocalyptic number.
11101223121031 is a deficient number, since it is larger than the sum of its proper divisors (133879044473).
11101223121031 is an equidigital number, since it uses as much as digits as its factorization.
11101223121031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1540181.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 11101223121031 its reverse (13012132210111), we get a palindrome (24113355331142).
The spelling of 11101223121031 in words is "eleven trillion, one hundred one billion, two hundred twenty-three million, one hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •