Base | Representation |
---|---|
bin | 1001010100010000001… |
… | …11110111011101010001 |
3 | 1010121021002222010111000 |
4 | 10222020013313131101 |
5 | 20221042000442231 |
6 | 403020201012213 |
7 | 32061441344601 |
oct | 4521007673521 |
9 | 1117232863430 |
10 | 320111343441 |
11 | 11383856529a |
12 | 52058784069 |
13 | 242565bc226 |
14 | 116ca12cc01 |
15 | 84d80c06e6 |
hex | 4a881f7751 |
320111343441 has 32 divisors (see below), whose sum is σ = 481029580800. Its totient is φ = 210353204880.
The previous prime is 320111343437. The next prime is 320111343443. The reversal of 320111343441 is 144343111023.
320111343441 is a `hidden beast` number, since 3 + 201 + 1 + 13 + 4 + 3 + 441 = 666.
It is not a de Polignac number, because 320111343441 - 22 = 320111343437 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (320111343443) 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 in 31 ways as a sum of consecutive naturals, for example, 9504930 + ... + 9538548.
It is an arithmetic number, because the mean of its divisors is an integer number (15032174400).
Almost surely, 2320111343441 is an apocalyptic number.
It is an amenable number.
320111343441 is a deficient number, since it is larger than the sum of its proper divisors (160918237359).
320111343441 is a wasteful number, since it uses less digits than its factorization.
320111343441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38666 (or 38660 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 320111343441 its reverse (144343111023), we get a palindrome (464454454464).
The spelling of 320111343441 in words is "three hundred twenty billion, one hundred eleven million, three hundred forty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •