Base | Representation |
---|---|
bin | 100001111011000110100… |
… | …010100011111100010001 |
3 | 22020212020120010212011201 |
4 | 201323012202203330101 |
5 | 301143301011121223 |
6 | 4542535011311201 |
7 | 330265250311066 |
oct | 41730642437421 |
9 | 8225216125151 |
10 | 2331203223313 |
11 | 819726499648 |
12 | 3179772ab501 |
13 | 13baa6b0a713 |
14 | 80b8bb68c6d |
15 | 4098ec3aead |
hex | 21ec68a3f11 |
2331203223313 has 4 divisors (see below), whose sum is σ = 2333861380660. Its totient is φ = 2328545065968.
The previous prime is 2331203223233. The next prime is 2331203223353. The reversal of 2331203223313 is 3133223021332.
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 1250243768449 + 1080959454864 = 1118143^2 + 1039692^2 .
It is a cyclic number.
It is not a de Polignac number, because 2331203223313 - 29 = 2331203222801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2331203223353) 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, 1329077358 + ... + 1329079111.
It is an arithmetic number, because the mean of its divisors is an integer number (583465345165).
Almost surely, 22331203223313 is an apocalyptic number.
It is an amenable number.
2331203223313 is a deficient number, since it is larger than the sum of its proper divisors (2658157347).
2331203223313 is an equidigital number, since it uses as much as digits as its factorization.
2331203223313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2658157346.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 2331203223313 its reverse (3133223021332), we get a palindrome (5464426244645).
The spelling of 2331203223313 in words is "two trillion, three hundred thirty-one billion, two hundred three million, two hundred twenty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •