Base | Representation |
---|---|
bin | 1001100011011110011001… |
… | …10011111110000011100011 |
3 | 2202101112210110202012021202 |
4 | 10301233030303332003203 |
5 | 10223212212013022243 |
6 | 112403525541311415 |
7 | 4265634250515614 |
oct | 461571463760343 |
9 | 82345713665252 |
10 | 21010121220323 |
11 | 6770384772624 |
12 | 2433a9b10556b |
13 | b95327400231 |
14 | 528c7697dc0b |
15 | 2667c4e524b8 |
hex | 131bcccfe0e3 |
21010121220323 has 4 divisors (see below), whose sum is σ = 21366224969880. Its totient is φ = 20654017470768.
The previous prime is 21010121220289. The next prime is 21010121220329. The reversal of 21010121220323 is 32302212101012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21010121220323 - 210 = 21010121219299 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21010121220295 and 21010121220304.
It is not an unprimeable number, because it can be changed into a prime (21010121220329) 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, 178051874690 + ... + 178051874807.
It is an arithmetic number, because the mean of its divisors is an integer number (5341556242470).
Almost surely, 221010121220323 is an apocalyptic number.
21010121220323 is a deficient number, since it is larger than the sum of its proper divisors (356103749557).
21010121220323 is an equidigital number, since it uses as much as digits as its factorization.
21010121220323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356103749556.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 21010121220323 its reverse (32302212101012), we get a palindrome (53312333321335).
The spelling of 21010121220323 in words is "twenty-one trillion, ten billion, one hundred twenty-one million, two hundred twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •