Base | Representation |
---|---|
bin | 1001101010011111101… |
… | …11110011100101110101 |
3 | 1011202002022101022000121 |
4 | 10311033313303211311 |
5 | 20420020420323333 |
6 | 412313125411541 |
7 | 32663366526502 |
oct | 4651767634565 |
9 | 1152068338017 |
10 | 332052511093 |
11 | 118905a93296 |
12 | 5442b869bb1 |
13 | 2540a4c53c4 |
14 | 120dddd44a9 |
15 | 89865be32d |
hex | 4d4fdf3975 |
332052511093 has 4 divisors (see below), whose sum is σ = 332054317888. Its totient is φ = 332050704300.
The previous prime is 332052510997. The next prime is 332052511127. The reversal of 332052511093 is 390115250233.
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 an emirpimes, since its reverse is a distinct semiprime: 390115250233 = 1063 ⋅366994591.
It is a cyclic number.
It is not a de Polignac number, because 332052511093 - 217 = 332052380021 is a prime.
It is a super-2 number, since 2×3320525110932 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (332052511793) 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, 591933 + ... + 1007218.
It is an arithmetic number, because the mean of its divisors is an integer number (83013579472).
Almost surely, 2332052511093 is an apocalyptic number.
It is an amenable number.
332052511093 is a deficient number, since it is larger than the sum of its proper divisors (1806795).
332052511093 is a wasteful number, since it uses less digits than its factorization.
332052511093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1806794.
The product of its (nonzero) digits is 24300, while the sum is 34.
The spelling of 332052511093 in words is "three hundred thirty-two billion, fifty-two million, five hundred eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •