Base | Representation |
---|---|
bin | 10000001001110001111… |
… | …100011001110110011101 |
3 | 10221010010201201011102222 |
4 | 100021301330121312131 |
5 | 121141301341103201 |
6 | 2205533311355125 |
7 | 143124106466324 |
oct | 20116174316635 |
9 | 3833121634388 |
10 | 1110013222301 |
11 | 398832587125 |
12 | 15b165222aa5 |
13 | 8089b444b99 |
14 | 3ba212ad0bb |
15 | 1dd19ac191b |
hex | 10271f19d9d |
1110013222301 has 8 divisors (see below), whose sum is σ = 1110665976000. Its totient is φ = 1109360568672.
The previous prime is 1110013222271. The next prime is 1110013222333. The reversal of 1110013222301 is 1032223100111.
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 1110013222301 - 222 = 1110009027997 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1110013222301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110013222391) 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, 38934950 + ... + 38963448.
It is an arithmetic number, because the mean of its divisors is an integer number (138833247000).
Almost surely, 21110013222301 is an apocalyptic number.
It is an amenable number.
1110013222301 is a deficient number, since it is larger than the sum of its proper divisors (652753699).
1110013222301 is a wasteful number, since it uses less digits than its factorization.
1110013222301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50035.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1110013222301 its reverse (1032223100111), we get a palindrome (2142236322412).
The spelling of 1110013222301 in words is "one trillion, one hundred ten billion, thirteen million, two hundred twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •