Base | Representation |
---|---|
bin | 100000010110100111000… |
… | …101100000110101011001 |
3 | 21212112201200200212021101 |
4 | 200112213011200311121 |
5 | 242411310120113223 |
6 | 4421212011311401 |
7 | 316425323340355 |
oct | 40264705406531 |
9 | 7775650625241 |
10 | 2223301332313 |
11 | 787995705916 |
12 | 2baa8314b561 |
13 | 13186c1b8a39 |
14 | 7987349c465 |
15 | 3cc76e354ad |
hex | 205a7160d59 |
2223301332313 has 4 divisors (see below), whose sum is σ = 2224120834228. Its totient is φ = 2222481830400.
The previous prime is 2223301332271. The next prime is 2223301332391. The reversal of 2223301332313 is 3132331033222.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2178496296729 + 44805035584 = 1475973^2 + 211672^2 .
It is a cyclic number.
It is not a de Polignac number, because 2223301332313 - 213 = 2223301324121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2223301332113) 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, 409746888 + ... + 409752313.
It is an arithmetic number, because the mean of its divisors is an integer number (556030208557).
Almost surely, 22223301332313 is an apocalyptic number.
It is an amenable number.
2223301332313 is a deficient number, since it is larger than the sum of its proper divisors (819501915).
2223301332313 is an equidigital number, since it uses as much as digits as its factorization.
2223301332313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 819501914.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 2223301332313 its reverse (3132331033222), we get a palindrome (5355632365535).
The spelling of 2223301332313 in words is "two trillion, two hundred twenty-three billion, three hundred one million, three hundred thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •