Base | Representation |
---|---|
bin | 1001100011110110111101… |
… | …00001101001101111110011 |
3 | 2202102210211011011202021022 |
4 | 10301323132201221233303 |
5 | 10223421211121412243 |
6 | 112413545555250055 |
7 | 4266612024445106 |
oct | 461733641515763 |
9 | 82383734152238 |
10 | 21023303310323 |
11 | 6775a29707986 |
12 | 24365598a992b |
13 | b966484281a2 |
14 | 52976758873d |
15 | 266ce7371b68 |
hex | 131ede869bf3 |
21023303310323 has 4 divisors (see below), whose sum is σ = 21024318116160. Its totient is φ = 21022288504488.
The previous prime is 21023303310263. The next prime is 21023303310349. The reversal of 21023303310323 is 32301330332012.
It is a happy number.
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 21023303310323 - 28 = 21023303310067 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21023303310292 and 21023303310301.
It is not an unprimeable number, because it can be changed into a prime (21023303313323) 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, 507371843 + ... + 507413276.
It is an arithmetic number, because the mean of its divisors is an integer number (5256079529040).
Almost surely, 221023303310323 is an apocalyptic number.
21023303310323 is a deficient number, since it is larger than the sum of its proper divisors (1014805837).
21023303310323 is a wasteful number, since it uses less digits than its factorization.
21023303310323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1014805836.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 21023303310323 its reverse (32301330332012), we get a palindrome (53324633642335).
The spelling of 21023303310323 in words is "twenty-one trillion, twenty-three billion, three hundred three million, three hundred ten thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •