Base | Representation |
---|---|
bin | 1001101000111010001… |
… | …00111101001000100001 |
3 | 1011122212220211111122202 |
4 | 10310131010331020201 |
5 | 20411244240220113 |
6 | 412052404142545 |
7 | 32633311161452 |
oct | 4643504751041 |
9 | 1148786744582 |
10 | 331200320033 |
11 | 118508a45560 |
12 | 54232397a55 |
13 | 25302a9aa3b |
14 | 1205cb61129 |
15 | 8936888258 |
hex | 4d1d13d221 |
331200320033 has 32 divisors (see below), whose sum is σ = 367271573760. Its totient is φ = 296165928960.
The previous prime is 331200320027. The next prime is 331200320051. The reversal of 331200320033 is 330023002133.
It is not a de Polignac number, because 331200320033 - 224 = 331183542817 is a prime.
It is a super-2 number, since 2×3312003200332 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 331200319987 and 331200320014.
It is not an unprimeable number, because it can be changed into a prime (331200320063) 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 31 ways as a sum of consecutive naturals, for example, 206097716 + ... + 206099322.
It is an arithmetic number, because the mean of its divisors is an integer number (11477236680).
Almost surely, 2331200320033 is an apocalyptic number.
It is an amenable number.
331200320033 is a deficient number, since it is larger than the sum of its proper divisors (36071253727).
331200320033 is a wasteful number, since it uses less digits than its factorization.
331200320033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2777.
The product of its (nonzero) digits is 972, while the sum is 20.
Adding to 331200320033 its reverse (330023002133), we get a palindrome (661223322166).
The spelling of 331200320033 in words is "three hundred thirty-one billion, two hundred million, three hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •