Base | Representation |
---|---|
bin | 100101000111000001101100… |
… | …1101010010110110000111001 |
3 | 1120210202120002022120011222020 |
4 | 1022032003121222112300321 |
5 | 320241041022030131121 |
6 | 3114123451423545053 |
7 | 125520102540232665 |
oct | 11216033152266071 |
9 | 1523676068504866 |
10 | 326421166255161 |
11 | 9500a49162906a |
12 | 3073a73815b189 |
13 | 1101a4cb56c3c3 |
14 | 5a86c23b958a5 |
15 | 27b0e6c3b41c6 |
hex | 128e0d9a96c39 |
326421166255161 has 16 divisors (see below), whose sum is σ = 461166992244864. Its totient is φ = 204663453910784.
The previous prime is 326421166255157. The next prime is 326421166255213. The reversal of 326421166255161 is 161552661124623.
It is a cyclic number.
It is not a de Polignac number, because 326421166255161 - 22 = 326421166255157 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (326421166257161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2340974550 + ... + 2341113983.
It is an arithmetic number, because the mean of its divisors is an integer number (28822937015304).
Almost surely, 2326421166255161 is an apocalyptic number.
It is an amenable number.
326421166255161 is a deficient number, since it is larger than the sum of its proper divisors (134745825989703).
326421166255161 is a wasteful number, since it uses less digits than its factorization.
326421166255161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4682089920.
The product of its digits is 3110400, while the sum is 51.
The spelling of 326421166255161 in words is "three hundred twenty-six trillion, four hundred twenty-one billion, one hundred sixty-six million, two hundred fifty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •