Base | Representation |
---|---|
bin | 11101100110100001000… |
… | …010110110101011001101 |
3 | 21012110200101110122121112 |
4 | 131212201002312223031 |
5 | 231312041140123041 |
6 | 4154301452341405 |
7 | 266652621461462 |
oct | 35464102665315 |
9 | 7173611418545 |
10 | 2034221411021 |
11 | 714787a55458 |
12 | 28a2b4774865 |
13 | 119a983908c7 |
14 | 70657805669 |
15 | 37dac514deb |
hex | 1d9a10b6acd |
2034221411021 has 8 divisors (see below), whose sum is σ = 2073707258904. Its totient is φ = 1994776463680.
The previous prime is 2034221410997. The next prime is 2034221411081. The reversal of 2034221411021 is 1201141224302.
It can be written as a sum of positive squares in 4 ways, for example, as 1229592676900 + 804628734121 = 1108870^2 + 897011^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 2034221411021 - 214 = 2034221394637 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 (2034221411081) 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, 10124690 + ... + 10323651.
It is an arithmetic number, because the mean of its divisors is an integer number (259213407363).
Almost surely, 22034221411021 is an apocalyptic number.
It is an amenable number.
2034221411021 is a deficient number, since it is larger than the sum of its proper divisors (39485847883).
2034221411021 is a wasteful number, since it uses less digits than its factorization.
2034221411021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20450271.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 2034221411021 its reverse (1201141224302), we get a palindrome (3235362635323).
The spelling of 2034221411021 in words is "two trillion, thirty-four billion, two hundred twenty-one million, four hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •