Base | Representation |
---|---|
bin | 1001100011110001011010… |
… | …11111100101001011110001 |
3 | 2202102112011011101112000110 |
4 | 10301320231133211023301 |
5 | 10223344120244400423 |
6 | 112412335135411533 |
7 | 4266445311101502 |
oct | 461705537451361 |
9 | 82375134345013 |
10 | 21020333200113 |
11 | 6774745102145 |
12 | 2435a6b083ba9 |
13 | b96293caa720 |
14 | 529564d22ba9 |
15 | 266bc1734193 |
hex | 131e2d7e52f1 |
21020333200113 has 8 divisors (see below), whose sum is σ = 30183042543808. Its totient is φ = 12935589661584.
The previous prime is 21020333200057. The next prime is 21020333200211. The reversal of 21020333200113 is 31100233302012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21020333200113 - 28 = 21020333199857 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21020333200113.
It is not an unprimeable number, because it can be changed into a prime (21020333200313) 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, 269491451245 + ... + 269491451322.
It is an arithmetic number, because the mean of its divisors is an integer number (3772880317976).
Almost surely, 221020333200113 is an apocalyptic number.
It is an amenable number.
21020333200113 is a deficient number, since it is larger than the sum of its proper divisors (9162709343695).
21020333200113 is a wasteful number, since it uses less digits than its factorization.
21020333200113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 538982902583.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 21020333200113 its reverse (31100233302012), we get a palindrome (52120566502125).
The spelling of 21020333200113 in words is "twenty-one trillion, twenty billion, three hundred thirty-three million, two hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •