Base | Representation |
---|---|
bin | 11101101101111110000… |
… | …10010110010111101001 |
3 | 10121121200001222001202110 |
4 | 32312333002112113221 |
5 | 113212214223011241 |
6 | 2101031552352533 |
7 | 133526054311632 |
oct | 16667702262751 |
9 | 3547601861673 |
10 | 1021112313321 |
11 | 36406230a421 |
12 | 145a94545749 |
13 | 753a1245929 |
14 | 375ca354889 |
15 | 1b864e9b816 |
hex | edbf0965e9 |
1021112313321 has 8 divisors (see below), whose sum is σ = 1362524775264. Its totient is φ = 680220696800.
The previous prime is 1021112313313. The next prime is 1021112313329. The reversal of 1021112313321 is 1233132111201.
It is an interprime number because it is at equal distance from previous prime (1021112313313) and next prime (1021112313329).
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 1021112313321 - 23 = 1021112313313 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1021112313329) 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, 130206780 + ... + 130214621.
It is an arithmetic number, because the mean of its divisors is an integer number (170315596908).
Almost surely, 21021112313321 is an apocalyptic number.
It is an amenable number.
1021112313321 is a deficient number, since it is larger than the sum of its proper divisors (341412461943).
1021112313321 is a wasteful number, since it uses less digits than its factorization.
1021112313321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 260422711.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1021112313321 its reverse (1233132111201), we get a palindrome (2254244424522).
The spelling of 1021112313321 in words is "one trillion, twenty-one billion, one hundred twelve million, three hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •