Base | Representation |
---|---|
bin | 1001010100001110111… |
… | …10001100101011010111 |
3 | 1010121020100102011202122 |
4 | 10222013132030223113 |
5 | 20221031201422221 |
6 | 403015130530155 |
7 | 32061246452000 |
oct | 4520736145327 |
9 | 1117210364678 |
10 | 320100420311 |
11 | 113832384611 |
12 | 52054b9695b |
13 | 24254266439 |
14 | 116c88c81a7 |
15 | 84d7163eab |
hex | 4a8778cad7 |
320100420311 has 8 divisors (see below), whose sum is σ = 373294951200. Its totient is φ = 274371788544.
The previous prime is 320100420281. The next prime is 320100420319. The reversal of 320100420311 is 113024001023.
It is a de Polignac number, because none of the positive numbers 2k-320100420311 is a prime.
It is a super-2 number, since 2×3201004203112 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 320100420311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320100420319) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 466618346 + ... + 466619031.
It is an arithmetic number, because the mean of its divisors is an integer number (46661868900).
Almost surely, 2320100420311 is an apocalyptic number.
320100420311 is a deficient number, since it is larger than the sum of its proper divisors (53194530889).
320100420311 is an frugal number, since it uses more digits than its factorization.
320100420311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 933237398 (or 933237384 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 320100420311 its reverse (113024001023), we get a palindrome (433124421334).
The spelling of 320100420311 in words is "three hundred twenty billion, one hundred million, four hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •