Base | Representation |
---|---|
bin | 1001101010011001110… |
… | …00011000100110000011 |
3 | 1011201221210221212220001 |
4 | 10311030320120212003 |
5 | 20414420044043021 |
6 | 412304134100431 |
7 | 32662220152051 |
oct | 4651470304603 |
9 | 1151853855801 |
10 | 332002331011 |
11 | 11888a72a24a |
12 | 54416aaa717 |
13 | 253ccca6050 |
14 | 120d74911d1 |
15 | 8981eab091 |
hex | 4d4ce18983 |
332002331011 has 16 divisors (see below), whose sum is σ = 395032486464. Its totient is φ = 275895696384.
The previous prime is 332002330987. The next prime is 332002331029. The reversal of 332002331011 is 110133200233.
It is a cyclic number.
It is not a de Polignac number, because 332002331011 - 217 = 332002199939 is a prime.
It is a super-2 number, since 2×3320023310112 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 332002331011.
It is not an unprimeable number, because it can be changed into a prime (332002331051) 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 15 ways as a sum of consecutive naturals, for example, 32653026 + ... + 32663191.
It is an arithmetic number, because the mean of its divisors is an integer number (24689530404).
Almost surely, 2332002331011 is an apocalyptic number.
332002331011 is a deficient number, since it is larger than the sum of its proper divisors (63030155453).
332002331011 is a wasteful number, since it uses less digits than its factorization.
332002331011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65316270.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 332002331011 its reverse (110133200233), we get a palindrome (442135531244).
The spelling of 332002331011 in words is "three hundred thirty-two billion, two million, three hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •