Base | Representation |
---|---|
bin | 1001001011111011111011… |
… | …11000110010000101101001 |
3 | 2122112020012100021100202000 |
4 | 10211331331320302011221 |
5 | 10121434322331332223 |
6 | 110544211410201213 |
7 | 4153333055160150 |
oct | 445757570620551 |
9 | 78466170240660 |
10 | 20201343230313 |
11 | 6489383673033 |
12 | 23231a4b83209 |
13 | b36c94995b3b |
14 | 4dba708b4597 |
15 | 25073b1d9543 |
hex | 125f7de32169 |
20201343230313 has 64 divisors (see below), whose sum is σ = 34638523392000. Its totient is φ = 11396766655872.
The previous prime is 20201343230297. The next prime is 20201343230351. The reversal of 20201343230313 is 31303234310202.
20201343230313 is a `hidden beast` number, since 2 + 0 + 2 + 0 + 1 + 343 + 2 + 3 + 0 + 313 = 666.
It is not a de Polignac number, because 20201343230313 - 24 = 20201343230297 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (20201343230363) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 300183973 + ... + 300251261.
It is an arithmetic number, because the mean of its divisors is an integer number (541226928000).
Almost surely, 220201343230313 is an apocalyptic number.
It is an amenable number.
20201343230313 is a deficient number, since it is larger than the sum of its proper divisors (14437180161687).
20201343230313 is a wasteful number, since it uses less digits than its factorization.
20201343230313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87491 (or 87485 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 27.
Adding to 20201343230313 its reverse (31303234310202), we get a palindrome (51504577540515).
The spelling of 20201343230313 in words is "twenty trillion, two hundred one billion, three hundred forty-three million, two hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •