Base | Representation |
---|---|
bin | 100100011010000101011011… |
… | …0111101101000011010110001 |
3 | 1112222220001211022220012012111 |
4 | 1020310022312331220122301 |
5 | 313433341033302242001 |
6 | 3053034131151325321 |
7 | 124311616203046210 |
oct | 11064126675503261 |
9 | 1488801738805174 |
10 | 320244421134001 |
11 | 93048994a80151 |
12 | 2bb01620820841 |
13 | 1098cbc4a0c8a0 |
14 | 5911cac59d077 |
15 | 270545b861851 |
hex | 12342b6f686b1 |
320244421134001 has 48 divisors (see below), whose sum is σ = 425320140743680. Its totient is φ = 234545486820480.
The previous prime is 320244421133971. The next prime is 320244421134007. The reversal of 320244421134001 is 100431124442023.
It is a happy number.
It is not a de Polignac number, because 320244421134001 - 221 = 320244419036849 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is not an unprimeable number, because it can be changed into a prime (320244421134007) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 105805986 + ... + 108790603.
Almost surely, 2320244421134001 is an apocalyptic number.
320244421134001 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
320244421134001 is a deficient number, since it is larger than the sum of its proper divisors (105075719609679).
320244421134001 is a wasteful number, since it uses less digits than its factorization.
320244421134001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 214596686 (or 214596663 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 320244421134001 its reverse (100431124442023), we get a palindrome (420675545576024).
The spelling of 320244421134001 in words is "three hundred twenty trillion, two hundred forty-four billion, four hundred twenty-one million, one hundred thirty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •