Base | Representation |
---|---|
bin | 1001010100000101011… |
… | …00100100010110011101 |
3 | 1010121000202122201000122 |
4 | 10222002230210112131 |
5 | 20220400144114323 |
6 | 403003145404325 |
7 | 32056254451424 |
oct | 4520254442635 |
9 | 1117022581018 |
10 | 320020301213 |
11 | 1137a1131988 |
12 | 520321996a5 |
13 | 24240793aa2 |
14 | 116bbdd02bb |
15 | 84d00d9ec8 |
hex | 4a82b2459d |
320020301213 has 8 divisors (see below), whose sum is σ = 337372124160. Its totient is φ = 303107765040.
The previous prime is 320020301203. The next prime is 320020301233. The reversal of 320020301213 is 312103020023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 320020301213 - 212 = 320020297117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 320020301191 and 320020301200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320020301203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 109820198 + ... + 109823111.
It is an arithmetic number, because the mean of its divisors is an integer number (42171515520).
Almost surely, 2320020301213 is an apocalyptic number.
It is an amenable number.
320020301213 is a deficient number, since it is larger than the sum of its proper divisors (17351822947).
320020301213 is a wasteful number, since it uses less digits than its factorization.
320020301213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219643387.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 320020301213 its reverse (312103020023), we get a palindrome (632123321236).
The spelling of 320020301213 in words is "three hundred twenty billion, twenty million, three hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •