Base | Representation |
---|---|
bin | 11101100010111111001… |
… | …111101011001101100001 |
3 | 21012002220101010120211012 |
4 | 131202333033223031201 |
5 | 231231311334333441 |
6 | 4152433524230305 |
7 | 266460011523506 |
oct | 35427717531541 |
9 | 7162811116735 |
10 | 2030433121121 |
11 | 713113622159 |
12 | 289617b3b395 |
13 | 119613596552 |
14 | 703b86414ad |
15 | 37c39b5d9eb |
hex | 1d8bf3eb361 |
2030433121121 has 4 divisors (see below), whose sum is σ = 2031604751892. Its totient is φ = 2029261490352.
The previous prime is 2030433121027. The next prime is 2030433121139. The reversal of 2030433121121 is 1211213340302.
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 1620628295521 + 409804825600 = 1273039^2 + 640160^2 .
It is a cyclic number.
It is not a de Polignac number, because 2030433121121 - 222 = 2030428926817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2030433121141) 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, 585812786 + ... + 585816251.
It is an arithmetic number, because the mean of its divisors is an integer number (507901187973).
Almost surely, 22030433121121 is an apocalyptic number.
It is an amenable number.
2030433121121 is a deficient number, since it is larger than the sum of its proper divisors (1171630771).
2030433121121 is a wasteful number, since it uses less digits than its factorization.
2030433121121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1171630770.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 2030433121121 its reverse (1211213340302), we get a palindrome (3241646461423).
The spelling of 2030433121121 in words is "two trillion, thirty billion, four hundred thirty-three million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.056 sec. • engine limits •