Base | Representation |
---|---|
bin | 1001010100000101011… |
… | …00100110110010011111 |
3 | 1010121000202200012201111 |
4 | 10222002230212302133 |
5 | 20220400144424244 |
6 | 403003145522451 |
7 | 32056254522511 |
oct | 4520254466237 |
9 | 1117022605644 |
10 | 320020311199 |
11 | 1137a1139436 |
12 | 520321a3427 |
13 | 242407984b4 |
14 | 116bbdd3bb1 |
15 | 84d00dce34 |
hex | 4a82b26c9f |
320020311199 has 2 divisors, whose sum is σ = 320020311200. Its totient is φ = 320020311198.
The previous prime is 320020311173. The next prime is 320020311203. The reversal of 320020311199 is 991113020023.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 320020311199 - 213 = 320020303007 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 320020311199.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (320020111199) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160010155599 + 160010155600.
It is an arithmetic number, because the mean of its divisors is an integer number (160010155600).
Almost surely, 2320020311199 is an apocalyptic number.
320020311199 is a deficient number, since it is larger than the sum of its proper divisors (1).
320020311199 is an equidigital number, since it uses as much as digits as its factorization.
320020311199 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 31.
The spelling of 320020311199 in words is "three hundred twenty billion, twenty million, three hundred eleven thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •