Base | Representation |
---|---|
bin | 1001001011111101101101… |
… | …11111001111000100110111 |
3 | 2122112022200002220102221220 |
4 | 10211332312333033010313 |
5 | 10121443303103120343 |
6 | 110544450431241423 |
7 | 4153365600033330 |
oct | 445766677170467 |
9 | 78468602812856 |
10 | 20202301223223 |
11 | 6489825405309 |
12 | 2323411979273 |
13 | b370b82b5a52 |
14 | 4dbb21c09287 |
15 | 25079536e183 |
hex | 125fb6fcf137 |
20202301223223 has 16 divisors (see below), whose sum is σ = 31777506072576. Its totient is φ = 11171779477920.
The previous prime is 20202301223171. The next prime is 20202301223261. The reversal of 20202301223223 is 32232210320202.
It is not a de Polignac number, because 20202301223223 - 217 = 20202301092151 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20202301223193 and 20202301223202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20202301223123) 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 15 ways as a sum of consecutive naturals, for example, 15516359736 + ... + 15516361037.
It is an arithmetic number, because the mean of its divisors is an integer number (1986094129536).
Almost surely, 220202301223223 is an apocalyptic number.
20202301223223 is a deficient number, since it is larger than the sum of its proper divisors (11575204849353).
20202301223223 is a wasteful number, since it uses less digits than its factorization.
20202301223223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31032720814.
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 20202301223223 its reverse (32232210320202), we get a palindrome (52434511543425).
The spelling of 20202301223223 in words is "twenty trillion, two hundred two billion, three hundred one million, two hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •