Base | Representation |
---|---|
bin | 1001101000100110010… |
… | …00100101100111011101 |
3 | 1011122110021221011202122 |
4 | 10310103020211213131 |
5 | 20410424034001000 |
6 | 412024044432325 |
7 | 32626214216156 |
oct | 4642310454735 |
9 | 1148407834678 |
10 | 331033500125 |
11 | 118432865269 |
12 | 541a65486a5 |
13 | 252a7360033 |
14 | 1204493892d |
15 | 8926dd5085 |
hex | 4d132259dd |
331033500125 has 16 divisors (see below), whose sum is σ = 431091977472. Its totient is φ = 253312589200.
The previous prime is 331033500121. The next prime is 331033500197. The reversal of 331033500125 is 521005330133.
It is not a de Polignac number, because 331033500125 - 22 = 331033500121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 331033500094 and 331033500103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331033500121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 57568169 + ... + 57573918.
It is an arithmetic number, because the mean of its divisors is an integer number (26943248592).
Almost surely, 2331033500125 is an apocalyptic number.
It is an amenable number.
331033500125 is a deficient number, since it is larger than the sum of its proper divisors (100058477347).
331033500125 is a wasteful number, since it uses less digits than its factorization.
331033500125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115142125 (or 115142115 counting only the distinct ones).
The product of its (nonzero) digits is 4050, while the sum is 26.
Adding to 331033500125 its reverse (521005330133), we get a palindrome (852038830258).
The spelling of 331033500125 in words is "three hundred thirty-one billion, thirty-three million, five hundred thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •