Base | Representation |
---|---|
bin | 1001100011110110011011… |
… | …10101000111101011111111 |
3 | 2202102210002122002201112210 |
4 | 10301323031311013223333 |
5 | 10223420122414413043 |
6 | 112413502111431503 |
7 | 4266602053530654 |
oct | 461731565075377 |
9 | 82383078081483 |
10 | 21023023201023 |
11 | 67758a5589698 |
12 | 243649bb25593 |
13 | b966023a2b3c |
14 | 52973c2b1c2b |
15 | 266ccc991633 |
hex | 131ecdd47aff |
21023023201023 has 32 divisors (see below), whose sum is σ = 30791070144000. Its totient is φ = 12699498784896.
The previous prime is 21023023201021. The next prime is 21023023201039. The reversal of 21023023201023 is 32010232032012.
It is a happy number.
It is not a de Polignac number, because 21023023201023 - 21 = 21023023201021 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21023023201021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17982661 + ... + 19116017.
It is an arithmetic number, because the mean of its divisors is an integer number (962220942000).
Almost surely, 221023023201023 is an apocalyptic number.
21023023201023 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
21023023201023 is a deficient number, since it is larger than the sum of its proper divisors (9768046942977).
21023023201023 is a wasteful number, since it uses less digits than its factorization.
21023023201023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1147551.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 21023023201023 its reverse (32010232032012), we get a palindrome (53033255233035).
The spelling of 21023023201023 in words is "twenty-one trillion, twenty-three billion, twenty-three million, two hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •