Base | Representation |
---|---|
bin | 1001010001110011100111… |
… | …00100000111010111110111 |
3 | 2200020111210111002210202210 |
4 | 10220321303210013113313 |
5 | 10133240403034100343 |
6 | 111221005120504503 |
7 | 4204033122204420 |
oct | 450716344072767 |
9 | 80214714083683 |
10 | 20403033503223 |
11 | 6556972563298 |
12 | 23562b277b133 |
13 | b4ccc8236ca7 |
14 | 507725268647 |
15 | 255ae2c40333 |
hex | 128e739075f7 |
20403033503223 has 8 divisors (see below), whose sum is σ = 31090336766848. Its totient is φ = 11658876287544.
The previous prime is 20403033503183. The next prime is 20403033503297. The reversal of 20403033503223 is 32230533030402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20403033503223 - 29 = 20403033502711 is a prime.
It is a super-2 number, since 2×204030335032232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20403033503323) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 485786511961 + ... + 485786512002.
It is an arithmetic number, because the mean of its divisors is an integer number (3886292095856).
Almost surely, 220403033503223 is an apocalyptic number.
20403033503223 is a deficient number, since it is larger than the sum of its proper divisors (10687303263625).
20403033503223 is an equidigital number, since it uses as much as digits as its factorization.
20403033503223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 971573023973.
The product of its (nonzero) digits is 38880, while the sum is 30.
Adding to 20403033503223 its reverse (32230533030402), we get a palindrome (52633566533625).
The spelling of 20403033503223 in words is "twenty trillion, four hundred three billion, thirty-three million, five hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •