Base | Representation |
---|---|
bin | 1001000110000101011111… |
… | …00011011100000111111010 |
3 | 2121211000022012111020111100 |
4 | 10203002233203130013322 |
5 | 10110141120114030320 |
6 | 110312003355312230 |
7 | 4132655254533066 |
oct | 443025743340772 |
9 | 77730265436440 |
10 | 20000313033210 |
11 | 64110a3333574 |
12 | 22b024044b676 |
13 | b210380c5ba3 |
14 | 4d203da64aa6 |
15 | 24a3c25bb790 |
hex | 1230af8dc1fa |
20000313033210 has 24 divisors (see below), whose sum is σ = 52000813886580. Its totient is φ = 5333416808832.
The previous prime is 20000313033079. The next prime is 20000313033313. The reversal of 20000313033210 is 1233031300002.
20000313033210 is a `hidden beast` number, since 20 + 0 + 0 + 0 + 313 + 0 + 332 + 1 + 0 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 19926197871129 + 74115162081 = 4463877^2 + 272241^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
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 11 ways as a sum of consecutive naturals, for example, 111112850095 + ... + 111112850274.
Almost surely, 220000313033210 is an apocalyptic number.
20000313033210 is an abundant number, since it is smaller than the sum of its proper divisors (32000500853370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000313033210 is a wasteful number, since it uses less digits than its factorization.
20000313033210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222225700382 (or 222225700379 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 20000313033210 its reverse (1233031300002), we get a palindrome (21233344333212).
The spelling of 20000313033210 in words is "twenty trillion, three hundred thirteen million, thirty-three thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •