Base | Representation |
---|---|
bin | 11110110000001011111… |
… | …000101110110111001101 |
3 | 21111000212010200112110021 |
4 | 132300023320232313031 |
5 | 234111041233043041 |
6 | 4254503005142141 |
7 | 305453056632160 |
oct | 36601370566715 |
9 | 7430763615407 |
10 | 2113323331021 |
11 | 745289a20761 |
12 | 2a16ab85a951 |
13 | 124393421c26 |
14 | 743dd1a3ad7 |
15 | 39e8bc35cd1 |
hex | 1ec0be2edcd |
2113323331021 has 8 divisors (see below), whose sum is σ = 2420268894720. Its totient is φ = 1807638325008.
The previous prime is 2113323331013. The next prime is 2113323331051. The reversal of 2113323331021 is 1201333233112.
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 2113323331021 - 23 = 2113323331013 is a prime.
It is a super-2 number, since 2×21133233310212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2113323331051) 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, 315135826 + ... + 315142531.
It is an arithmetic number, because the mean of its divisors is an integer number (302533611840).
Almost surely, 22113323331021 is an apocalyptic number.
It is an amenable number.
2113323331021 is a deficient number, since it is larger than the sum of its proper divisors (306945563699).
2113323331021 is an equidigital number, since it uses as much as digits as its factorization.
2113323331021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 630278843.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 2113323331021 its reverse (1201333233112), we get a palindrome (3314656564133).
The spelling of 2113323331021 in words is "two trillion, one hundred thirteen billion, three hundred twenty-three million, three hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •