Base | Representation |
---|---|
bin | 11101011101001101010… |
… | …01110110011010110101 |
3 | 10120202102220201222122002 |
4 | 32232212221312122311 |
5 | 113040302001200341 |
6 | 2052543004345045 |
7 | 133060053062606 |
oct | 16564651663265 |
9 | 3522386658562 |
10 | 1012113303221 |
11 | 360264634999 |
12 | 1441a2845185 |
13 | 74598a51097 |
14 | 36db5119dad |
15 | 1b4d9e1829b |
hex | eba6a766b5 |
1012113303221 has 8 divisors (see below), whose sum is σ = 1056145251840. Its totient is φ = 968083606512.
The previous prime is 1012113303209. The next prime is 1012113303259. The reversal of 1012113303221 is 1223033112101.
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 1012113303221 - 214 = 1012113286837 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012113303193 and 1012113303202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012113303281) 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, 389795 + ... + 1475183.
It is an arithmetic number, because the mean of its divisors is an integer number (132018156480).
Almost surely, 21012113303221 is an apocalyptic number.
It is an amenable number.
1012113303221 is a deficient number, since it is larger than the sum of its proper divisors (44031948619).
1012113303221 is a wasteful number, since it uses less digits than its factorization.
1012113303221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1125955.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1012113303221 its reverse (1223033112101), we get a palindrome (2235146415322).
The spelling of 1012113303221 in words is "one trillion, twelve billion, one hundred thirteen million, three hundred three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •