Base | Representation |
---|---|
bin | 10011110010100… |
… | …001110111011101 |
3 | 212010202000020120 |
4 | 103302201313131 |
5 | 1134443404041 |
6 | 52540105153 |
7 | 11141030664 |
oct | 2362416735 |
9 | 763660216 |
10 | 332013021 |
11 | 16045a32a |
12 | 932351b9 |
13 | 53a29112 |
14 | 32147ddb |
15 | 1e234366 |
hex | 13ca1ddd |
332013021 has 8 divisors (see below), whose sum is σ = 444260544. Its totient is φ = 220553760.
The previous prime is 332013013. The next prime is 332013079. The reversal of 332013021 is 120310233.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 332013021 - 23 = 332013013 is a prime.
It is a super-2 number, since 2×3320130212 = 220465292227092882, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (332014021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 196081 + ... + 197766.
It is an arithmetic number, because the mean of its divisors is an integer number (55532568).
Almost surely, 2332013021 is an apocalyptic number.
It is an amenable number.
332013021 is a deficient number, since it is larger than the sum of its proper divisors (112247523).
332013021 is a wasteful number, since it uses less digits than its factorization.
332013021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 394131.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 332013021 is about 18221.2244648926. The cubic root of 332013021 is about 692.4446095574. Note that the first 3 decimals are identical.
Adding to 332013021 its reverse (120310233), we get a palindrome (452323254).
The spelling of 332013021 in words is "three hundred thirty-two million, thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •