Base | Representation |
---|---|
bin | 100001111100111101100… |
… | …100000111100011010101 |
3 | 22021001101201122201111001 |
4 | 201330331210013203111 |
5 | 301211343212320041 |
6 | 4543505103543301 |
7 | 330365605536301 |
oct | 41747544074325 |
9 | 8231351581431 |
10 | 2333200120021 |
11 | 81a560706701 |
12 | 318233bbab31 |
13 | 13c0347393c4 |
14 | 80cdb056d01 |
15 | 40a5a1d9131 |
hex | 21f3d9078d5 |
2333200120021 has 8 divisors (see below), whose sum is σ = 2340585597240. Its totient is φ = 2325826302912.
The previous prime is 2333200120007. The next prime is 2333200120033. The reversal of 2333200120021 is 1200210023332.
It can be written as a sum of positive squares in 4 ways, for example, as 233178888996 + 2100021231025 = 482886^2 + 1449145^2 .
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 2333200120021 - 211 = 2333200117973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2333200123021) 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, 2514106 + ... + 3314683.
It is an arithmetic number, because the mean of its divisors is an integer number (292573199655).
Almost surely, 22333200120021 is an apocalyptic number.
It is an amenable number.
2333200120021 is a deficient number, since it is larger than the sum of its proper divisors (7385477219).
2333200120021 is an equidigital number, since it uses as much as digits as its factorization.
2333200120021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5830055.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 2333200120021 its reverse (1200210023332), we get a palindrome (3533410143353).
The spelling of 2333200120021 in words is "two trillion, three hundred thirty-three billion, two hundred million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •