Base | Representation |
---|---|
bin | 1001010100000101110… |
… | …00011101110110010111 |
3 | 1010121000222112011121210 |
4 | 10222002320131312113 |
5 | 20220401443422221 |
6 | 403003340312503 |
7 | 32056323122130 |
oct | 4520270356627 |
9 | 1117028464553 |
10 | 320023420311 |
11 | 1137a2972351 |
12 | 52033242733 |
13 | 242413166ca |
14 | 116bc5a2c87 |
15 | 84d0504276 |
hex | 4a82e1dd97 |
320023420311 has 8 divisors (see below), whose sum is σ = 487654735744. Its totient is φ = 182870525880.
The previous prime is 320023420291. The next prime is 320023420313. The reversal of 320023420311 is 113024320023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 320023420311 - 27 = 320023420183 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 15239210491 = 320023420311 / (3 + 2 + 0 + 0 + 2 + 3 + 4 + 2 + 0 + 3 + 1 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320023420313) 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, 7619605225 + ... + 7619605266.
It is an arithmetic number, because the mean of its divisors is an integer number (60956841968).
Almost surely, 2320023420311 is an apocalyptic number.
320023420311 is a deficient number, since it is larger than the sum of its proper divisors (167631315433).
320023420311 is a wasteful number, since it uses less digits than its factorization.
320023420311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15239210501.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 320023420311 its reverse (113024320023), we get a palindrome (433047740334).
The spelling of 320023420311 in words is "three hundred twenty billion, twenty-three million, four hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •