Base | Representation |
---|---|
bin | 11110110110011011001… |
… | …110101101001001001011 |
3 | 21111200011001200011100001 |
4 | 132312123032231021023 |
5 | 234213301414402311 |
6 | 4301531502423431 |
7 | 306111102605641 |
oct | 36663316551113 |
9 | 7450131604301 |
10 | 2120023200331 |
11 | 748107911733 |
12 | 2a2a5b591b77 |
13 | 124bc04b273a |
14 | 74876d15191 |
15 | 3a2300174c1 |
hex | 1ed9b3ad24b |
2120023200331 has 8 divisors (see below), whose sum is σ = 2124495928800. Its totient is φ = 2115554164608.
The previous prime is 2120023200221. The next prime is 2120023200367. The reversal of 2120023200331 is 1330023200212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2120023200331 is a prime.
It is a super-2 number, since 2×21200232003312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2120023200299 and 2120023200308.
It is not an unprimeable number, because it can be changed into a prime (2120023200931) 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, 227745 + ... + 2071693.
It is an arithmetic number, because the mean of its divisors is an integer number (265561991100).
Almost surely, 22120023200331 is an apocalyptic number.
2120023200331 is a deficient number, since it is larger than the sum of its proper divisors (4472728469).
2120023200331 is a wasteful number, since it uses less digits than its factorization.
2120023200331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1846373.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 2120023200331 its reverse (1330023200212), we get a palindrome (3450046400543).
The spelling of 2120023200331 in words is "two trillion, one hundred twenty billion, twenty-three million, two hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •