Base | Representation |
---|---|
bin | 101111011111111100011… |
… | …110111001000010010001 |
3 | 102120001020212101001002101 |
4 | 233133330132321002101 |
5 | 411434402212242113 |
6 | 10535303024520401 |
7 | 454552561232416 |
oct | 57377436710221 |
9 | 12501225331071 |
10 | 3264116134033 |
11 | 104933850a3a7 |
12 | 448735a80101 |
13 | 1a8a602a0011 |
14 | b3dac3b210d |
15 | 59d919812dd |
hex | 2f7fc7b9091 |
3264116134033 has 4 divisors (see below), whose sum is σ = 3264119766000. Its totient is φ = 3264112502068.
The previous prime is 3264116133973. The next prime is 3264116134051. The reversal of 3264116134033 is 3304316114623.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 3264116134033 - 29 = 3264116133521 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3264116133983 and 3264116134001.
It is not an unprimeable number, because it can be changed into a prime (3264116134073) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 632718 + ... + 2632216.
It is an arithmetic number, because the mean of its divisors is an integer number (816029941500).
Almost surely, 23264116134033 is an apocalyptic number.
It is an amenable number.
3264116134033 is a deficient number, since it is larger than the sum of its proper divisors (3631967).
3264116134033 is a wasteful number, since it uses less digits than its factorization.
3264116134033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3631966.
The product of its (nonzero) digits is 93312, while the sum is 37.
The spelling of 3264116134033 in words is "three trillion, two hundred sixty-four billion, one hundred sixteen million, one hundred thirty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •