Base | Representation |
---|---|
bin | 1001101010011010110… |
… | …10101101100111101111 |
3 | 1011201222102220002020002 |
4 | 10311031122231213233 |
5 | 20414424400030111 |
6 | 412305055014515 |
7 | 32662356512213 |
oct | 4651532554757 |
9 | 1151872802202 |
10 | 332011330031 |
11 | 118894816357 |
12 | 54419b0a43b |
13 | 25401b07104 |
14 | 120d8754943 |
15 | 8982b8763b |
hex | 4d4d6ad9ef |
332011330031 has 4 divisors (see below), whose sum is σ = 332389907112. Its totient is φ = 331632752952.
The previous prime is 332011329983. The next prime is 332011330039. The reversal of 332011330031 is 130033110233.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 332011330031 - 234 = 314831460847 is a prime.
It is a super-2 number, since 2×3320113300312 (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 = 332011329985 and 332011330012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (332011330039) 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, 189287225 + ... + 189288978.
It is an arithmetic number, because the mean of its divisors is an integer number (83097476778).
Almost surely, 2332011330031 is an apocalyptic number.
332011330031 is a deficient number, since it is larger than the sum of its proper divisors (378577081).
332011330031 is an equidigital number, since it uses as much as digits as its factorization.
332011330031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 378577080.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 332011330031 its reverse (130033110233), we get a palindrome (462044440264).
The spelling of 332011330031 in words is "three hundred thirty-two billion, eleven million, three hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •