Base | Representation |
---|---|
bin | 1001000110001011000011… |
… | …10101000111110110101110 |
3 | 2121211022000122112202202010 |
4 | 10203011201311013312232 |
5 | 10110213231311410410 |
6 | 110313220242342050 |
7 | 4133122343460336 |
oct | 443054165076656 |
9 | 77738018482663 |
10 | 20003304013230 |
11 | 64123986a308a |
12 | 22b093605a926 |
13 | b213c396c955 |
14 | 4d2244da00c6 |
15 | 24a4e9e7cc20 |
hex | 123161d47dae |
20003304013230 has 64 divisors (see below), whose sum is σ = 48599770867200. Its totient is φ = 5268489803136.
The previous prime is 20003304013181. The next prime is 20003304013279. The reversal of 20003304013230 is 3231040330002.
It is an interprime number because it is at equal distance from previous prime (20003304013181) and next prime (20003304013279).
It is a junction number, because it is equal to n+sod(n) for n = 20003304013197 and 20003304013206.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7912596 + ... + 10129944.
It is an arithmetic number, because the mean of its divisors is an integer number (759371419800).
Almost surely, 220003304013230 is an apocalyptic number.
20003304013230 is an abundant number, since it is smaller than the sum of its proper divisors (28596466853970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20003304013230 is a wasteful number, since it uses less digits than its factorization.
20003304013230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2221065.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 20003304013230 its reverse (3231040330002), we get a palindrome (23234344343232).
The spelling of 20003304013230 in words is "twenty trillion, three billion, three hundred four million, thirteen thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •