Base | Representation |
---|---|
bin | 1001100100001001100100… |
… | …11100111111111000101111 |
3 | 2202110202121221011210212112 |
4 | 10302010302130333320233 |
5 | 10224102200113423043 |
6 | 112422322031154235 |
7 | 4300414546162151 |
oct | 462046234777057 |
9 | 82422557153775 |
10 | 21033301311023 |
11 | 677a19a286881 |
12 | 243848a07597b |
13 | b9757c895631 |
14 | 52a03534aad1 |
15 | 2671cee87518 |
hex | 13213273fe2f |
21033301311023 has 4 divisors (see below), whose sum is σ = 21033314593488. Its totient is φ = 21033288028560.
The previous prime is 21033301310893. The next prime is 21033301311053. The reversal of 21033301311023 is 32011310333012.
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 21033301311023 - 216 = 21033301245487 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 21033301311023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21033301311053) 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, 3884486 + ... + 7560147.
It is an arithmetic number, because the mean of its divisors is an integer number (5258328648372).
Almost surely, 221033301311023 is an apocalyptic number.
21033301311023 is a deficient number, since it is larger than the sum of its proper divisors (13282465).
21033301311023 is a wasteful number, since it uses less digits than its factorization.
21033301311023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13282464.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 21033301311023 its reverse (32011310333012), we get a palindrome (53044611644035).
The spelling of 21033301311023 in words is "twenty-one trillion, thirty-three billion, three hundred one million, three hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •