Base | Representation |
---|---|
bin | 10011110001100101… |
… | …100010110001110111 |
3 | 2000210202200011202000 |
4 | 103301211202301313 |
5 | 321441123120043 |
6 | 13430533150343 |
7 | 1351113456315 |
oct | 236145426167 |
9 | 60722604660 |
10 | 21233020023 |
11 | 9006539236 |
12 | 4146a8b3b3 |
13 | 2004c90897 |
14 | 1055d6d0b5 |
15 | 84412a2d3 |
hex | 4f1962c77 |
21233020023 has 8 divisors (see below), whose sum is σ = 31456326000. Its totient is φ = 14155346664.
The previous prime is 21233020013. The next prime is 21233020027. The reversal of 21233020023 is 32002033212.
It is a happy number.
It is not a de Polignac number, because 21233020023 - 221 = 21230922871 is a prime.
It is a super-2 number, since 2×212330200232 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21233019978 and 21233020005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21233020027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 393204048 + ... + 393204101.
It is an arithmetic number, because the mean of its divisors is an integer number (3932040750).
Almost surely, 221233020023 is an apocalyptic number.
21233020023 is a deficient number, since it is larger than the sum of its proper divisors (10223305977).
21233020023 is an equidigital number, since it uses as much as digits as its factorization.
21233020023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 786408158 (or 786408152 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 21233020023 its reverse (32002033212), we get a palindrome (53235053235).
The spelling of 21233020023 in words is "twenty-one billion, two hundred thirty-three million, twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •