Base | Representation |
---|---|
bin | 1001101010110010110… |
… | …00111110011001000111 |
3 | 1011202111102212101102202 |
4 | 10311121120332121013 |
5 | 20420332310413111 |
6 | 412341032225115 |
7 | 33000346055024 |
oct | 4653130763107 |
9 | 1152442771382 |
10 | 332212201031 |
11 | 118988143747 |
12 | 5447523b19b |
13 | 254346079a9 |
14 | 121172c254b |
15 | 8995614b3b |
hex | 4d5963e647 |
332212201031 has 8 divisors (see below), whose sum is σ = 343741477680. Its totient is φ = 320687836672.
The previous prime is 332212200979. The next prime is 332212201163. The reversal of 332212201031 is 130102212233.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 332212201031 - 230 = 331138459207 is a prime.
It is a super-2 number, since 2×3322122010312 (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 = 332212200994 and 332212201012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (332212203031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1090205 + ... + 1361238.
It is an arithmetic number, because the mean of its divisors is an integer number (42967684710).
Almost surely, 2332212201031 is an apocalyptic number.
332212201031 is a deficient number, since it is larger than the sum of its proper divisors (11529276649).
332212201031 is a wasteful number, since it uses less digits than its factorization.
332212201031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2456145.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 332212201031 its reverse (130102212233), we get a palindrome (462314413264).
The spelling of 332212201031 in words is "three hundred thirty-two billion, two hundred twelve million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •