Base | Representation |
---|---|
bin | 1001100011110000110110… |
… | …11011110100001010101111 |
3 | 2202102111101001021200120202 |
4 | 10301320123123310022233 |
5 | 10223343010214114043 |
6 | 112412245113504115 |
7 | 4266434641612406 |
oct | 461703333641257 |
9 | 82374331250522 |
10 | 21020030223023 |
11 | 67745aa084a57 |
12 | 24359a571203b |
13 | b962462a9840 |
14 | 5295369b663d |
15 | 266ba4d381b8 |
hex | 131e1b6f42af |
21020030223023 has 32 divisors (see below), whose sum is σ = 23416515763200. Its totient is φ = 18749789675136.
The previous prime is 21020030223011. The next prime is 21020030223083. The reversal of 21020030223023 is 32032203002012.
It is not a de Polignac number, because 21020030223023 - 26 = 21020030222959 is a prime.
It is a super-2 number, since 2×210200302230232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21020030222986 and 21020030223004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21020030223083) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7968473 + ... + 10273101.
It is an arithmetic number, because the mean of its divisors is an integer number (731766117600).
Almost surely, 221020030223023 is an apocalyptic number.
21020030223023 is a deficient number, since it is larger than the sum of its proper divisors (2396485540177).
21020030223023 is a wasteful number, since it uses less digits than its factorization.
21020030223023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2304911.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 21020030223023 its reverse (32032203002012), we get a palindrome (53052233225035).
The spelling of 21020030223023 in words is "twenty-one trillion, twenty billion, thirty million, two hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •