Base | Representation |
---|---|
bin | 1001100011001100001001… |
… | …01100010100010011000101 |
3 | 2202100121111111111200111110 |
4 | 10301212010230110103011 |
5 | 10223032124224221013 |
6 | 112355225303355233 |
7 | 4265136352655211 |
oct | 461460454242305 |
9 | 82317444450443 |
10 | 21000321320133 |
11 | 67672059a9561 |
12 | 2432005152b19 |
13 | b9442500361c |
14 | 5285c7227941 |
15 | 2663ee91d2c3 |
hex | 131984b144c5 |
21000321320133 has 8 divisors (see below), whose sum is σ = 28394800658496. Its totient is φ = 13803028097600.
The previous prime is 21000321320117. The next prime is 21000321320141. The reversal of 21000321320133 is 33102312300012.
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 21000321320133 - 24 = 21000321320117 is a prime.
It is a super-2 number, since 2×210003213201332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21000321325133) 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, 49296528708 + ... + 49296529133.
It is an arithmetic number, because the mean of its divisors is an integer number (3549350082312).
Almost surely, 221000321320133 is an apocalyptic number.
It is an amenable number.
21000321320133 is a deficient number, since it is larger than the sum of its proper divisors (7394479338363).
21000321320133 is an equidigital number, since it uses as much as digits as its factorization.
21000321320133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98593057915.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 21000321320133 its reverse (33102312300012), we get a palindrome (54102633620145).
The spelling of 21000321320133 in words is "twenty-one trillion, three hundred twenty-one million, three hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •