Base | Representation |
---|---|
bin | 11101001010110001001… |
… | …00011100110011000001 |
3 | 10112210212222012020121102 |
4 | 32211120210130303001 |
5 | 112410013103030423 |
6 | 2044224353504145 |
7 | 132256531514342 |
oct | 16453044346301 |
9 | 3483788166542 |
10 | 1002213330113 |
11 | 35704432a636 |
12 | 14229b272055 |
13 | 7367b9b6728 |
14 | 367163940c9 |
15 | 1b10ac17c28 |
hex | e95891ccc1 |
1002213330113 has 4 divisors (see below), whose sum is σ = 1002391570368. Its totient is φ = 1002035089860.
The previous prime is 1002213330109. The next prime is 1002213330163. The reversal of 1002213330113 is 3110333122001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1002213330113 - 22 = 1002213330109 is a prime.
It is a super-2 number, since 2×10022133301132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1002213330163) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 89111693 + ... + 89122938.
It is an arithmetic number, because the mean of its divisors is an integer number (250597892592).
Almost surely, 21002213330113 is an apocalyptic number.
It is an amenable number.
1002213330113 is a deficient number, since it is larger than the sum of its proper divisors (178240255).
1002213330113 is an equidigital number, since it uses as much as digits as its factorization.
1002213330113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 178240254.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1002213330113 its reverse (3110333122001), we get a palindrome (4112546452114).
The spelling of 1002213330113 in words is "one trillion, two billion, two hundred thirteen million, three hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •