Base | Representation |
---|---|
bin | 10011110110001… |
… | …000010010000001 |
3 | 212012111221212101 |
4 | 103312020102001 |
5 | 1140214104201 |
6 | 53012230401 |
7 | 11152041352 |
oct | 2366102201 |
9 | 765457771 |
10 | 332956801 |
11 | 160a44411 |
12 | 9360b401 |
13 | 53c99878 |
14 | 32311d29 |
15 | 1e36dd01 |
hex | 13d88481 |
332956801 has 4 divisors (see below), whose sum is σ = 344438100. Its totient is φ = 321475504.
The previous prime is 332956787. The next prime is 332956807. The reversal of 332956801 is 108659233.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 90345025 + 242611776 = 9505^2 + 15576^2 .
It is a cyclic number.
It is not a de Polignac number, because 332956801 - 25 = 332956769 is a prime.
It is a super-2 number, since 2×3329568012 = 221720462664307202, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (332956807) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5740606 + ... + 5740663.
It is an arithmetic number, because the mean of its divisors is an integer number (86109525).
Almost surely, 2332956801 is an apocalyptic number.
It is an amenable number.
332956801 is a deficient number, since it is larger than the sum of its proper divisors (11481299).
332956801 is a wasteful number, since it uses less digits than its factorization.
332956801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11481298.
The product of its (nonzero) digits is 38880, while the sum is 37.
The square root of 332956801 is about 18247.1039071958. The cubic root of 332956801 is about 693.1001030480.
The spelling of 332956801 in words is "three hundred thirty-two million, nine hundred fifty-six thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •