Base | Representation |
---|---|
bin | 1001101010111110110… |
… | …01111010111001000011 |
3 | 1011202202110202012102220 |
4 | 10311133121322321003 |
5 | 20421034124042011 |
6 | 412355035142123 |
7 | 33003012563340 |
oct | 4653731727103 |
9 | 1152673665386 |
10 | 332313112131 |
11 | 118a2a0a7750 |
12 | 544a2ba4943 |
13 | 2544c4aa0c0 |
14 | 1212686d7c7 |
15 | 899e3e9506 |
hex | 4d5f67ae43 |
332313112131 has 96 divisors (see below), whose sum is σ = 611430962688. Its totient is φ = 155042242560.
The previous prime is 332313112127. The next prime is 332313112139. The reversal of 332313112131 is 131211313233.
It is not a de Polignac number, because 332313112131 - 22 = 332313112127 is a prime.
It is a super-2 number, since 2×3323131121312 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (332313112139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 4070691 + ... + 4151523.
It is an arithmetic number, because the mean of its divisors is an integer number (6369072528).
Almost surely, 2332313112131 is an apocalyptic number.
332313112131 is a deficient number, since it is larger than the sum of its proper divisors (279117850557).
332313112131 is a wasteful number, since it uses less digits than its factorization.
332313112131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80941 (or 80904 counting only the distinct ones).
The product of its digits is 972, while the sum is 24.
Adding to 332313112131 its reverse (131211313233), we get a palindrome (463524425364).
It can be divided in two parts, 332313 and 112131, that added together give a palindrome (444444).
The spelling of 332313112131 in words is "three hundred thirty-two billion, three hundred thirteen million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •