Base | Representation |
---|---|
bin | 1010000010000110000101… |
… | …1010000000000111110001 |
3 | 1110001120020001000201101202 |
4 | 2200201201122000013301 |
5 | 2421213203204103241 |
6 | 35243342211340545 |
7 | 2215654123542050 |
oct | 240414132000761 |
9 | 43046201021352 |
10 | 11031110222321 |
11 | 35732a415a452 |
12 | 12a1aa05b1755 |
13 | 6202c9808927 |
14 | 2a1ca1220397 |
15 | 141e279d7d9b |
hex | a08616801f1 |
11031110222321 has 8 divisors (see below), whose sum is σ = 13155112811904. Its totient is φ = 9044140057920.
The previous prime is 11031110222311. The next prime is 11031110222323. The reversal of 11031110222321 is 12322201113011.
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 11031110222321 - 234 = 11013930353137 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11031110222293 and 11031110222302.
It is not an unprimeable number, because it can be changed into a prime (11031110222323) 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, 34258106120 + ... + 34258106441.
It is an arithmetic number, because the mean of its divisors is an integer number (1644389101488).
Almost surely, 211031110222321 is an apocalyptic number.
It is an amenable number.
11031110222321 is a deficient number, since it is larger than the sum of its proper divisors (2124002589583).
11031110222321 is an equidigital number, since it uses as much as digits as its factorization.
11031110222321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68516212591.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 11031110222321 its reverse (12322201113011), we get a palindrome (23353311335332).
The spelling of 11031110222321 in words is "eleven trillion, thirty-one billion, one hundred ten million, two hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •