Base | Representation |
---|---|
bin | 1001000110010111111101… |
… | …11010011101100111111011 |
3 | 2121211221220122022001200200 |
4 | 10203023332322131213323 |
5 | 10110321430001401243 |
6 | 110320324052533243 |
7 | 4133456156016303 |
oct | 443137672354773 |
9 | 77757818261620 |
10 | 20010234403323 |
11 | 64153247227aa |
12 | 22b214b021223 |
13 | b21c597127a8 |
14 | 4d270159a603 |
15 | 24a7a35e6ad3 |
hex | 1232fee9d9fb |
20010234403323 has 12 divisors (see below), whose sum is σ = 28911663025128. Its totient is φ = 13336468064640.
The previous prime is 20010234403321. The next prime is 20010234403333. The reversal of 20010234403323 is 32330443201002.
20010234403323 is a `hidden beast` number, since 2 + 0 + 0 + 1 + 0 + 234 + 403 + 3 + 23 = 666.
It is not a de Polignac number, because 20010234403323 - 21 = 20010234403321 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20010234403321) 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 11 ways as a sum of consecutive naturals, for example, 307315993 + ... + 307381098.
It is an arithmetic number, because the mean of its divisors is an integer number (2409305252094).
Almost surely, 220010234403323 is an apocalyptic number.
20010234403323 is a deficient number, since it is larger than the sum of its proper divisors (8901428621805).
20010234403323 is a wasteful number, since it uses less digits than its factorization.
20010234403323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 614700714 (or 614700711 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 20010234403323 its reverse (32330443201002), we get a palindrome (52340677604325).
The spelling of 20010234403323 in words is "twenty trillion, ten billion, two hundred thirty-four million, four hundred three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •