Base | Representation |
---|---|
bin | 10000001100101001111… |
… | …100110000100110010101 |
3 | 10221102002212122010210002 |
4 | 100030221330300212111 |
5 | 121214112140320341 |
6 | 2211203510541045 |
7 | 143263443431465 |
oct | 20145174604625 |
9 | 3842085563702 |
10 | 1113100323221 |
11 | 39a0771287a7 |
12 | 15b887067785 |
13 | 80c70ba4913 |
14 | 3bc352a9ba5 |
15 | 1de4ab1d29b |
hex | 10329f30995 |
1113100323221 has 8 divisors (see below), whose sum is σ = 1161596508864. Its totient is φ = 1064612514240.
The previous prime is 1113100323199. The next prime is 1113100323227. The reversal of 1113100323221 is 1223230013111.
It is a happy number.
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 1113100323221 - 222 = 1113096128917 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1113100323193 and 1113100323202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113100323227) 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, 1821860 + ... + 2354861.
It is an arithmetic number, because the mean of its divisors is an integer number (145199563608).
Almost surely, 21113100323221 is an apocalyptic number.
It is an amenable number.
1113100323221 is a deficient number, since it is larger than the sum of its proper divisors (48496185643).
1113100323221 is a wasteful number, since it uses less digits than its factorization.
1113100323221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4188331.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1113100323221 its reverse (1223230013111), we get a palindrome (2336330336332).
The spelling of 1113100323221 in words is "one trillion, one hundred thirteen billion, one hundred million, three hundred twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •