Base | Representation |
---|---|
bin | 10000001010000100001… |
… | …110101111111011100101 |
3 | 10221010221010000011102221 |
4 | 100022010032233323211 |
5 | 121142413411134341 |
6 | 2210023551232341 |
7 | 143134523313655 |
oct | 20120416577345 |
9 | 3833833004387 |
10 | 1110320021221 |
11 | 39897a784754 |
12 | 15b22bb186b1 |
13 | 80919b834c8 |
14 | 3ba4dd32365 |
15 | 1dd369c4ed1 |
hex | 102843afee5 |
1110320021221 has 8 divisors (see below), whose sum is σ = 1129893269504. Its totient is φ = 1090791007920.
The previous prime is 1110320021203. The next prime is 1110320021263. The reversal of 1110320021221 is 1221200230111.
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 1110320021221 - 25 = 1110320021189 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110320021195 and 1110320021204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110320021201) 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, 11008101 + ... + 11108506.
It is an arithmetic number, because the mean of its divisors is an integer number (141236658688).
Almost surely, 21110320021221 is an apocalyptic number.
It is an amenable number.
1110320021221 is a deficient number, since it is larger than the sum of its proper divisors (19573248283).
1110320021221 is an equidigital number, since it uses as much as digits as its factorization.
1110320021221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22117491.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1110320021221 its reverse (1221200230111), we get a palindrome (2331520251332).
The spelling of 1110320021221 in words is "one trillion, one hundred ten billion, three hundred twenty million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •