Base | Representation |
---|---|
bin | 100101100010101111110110… |
… | …1010100010101111011011000 |
3 | 1121022020210021101022112022201 |
4 | 1023011133231110111323120 |
5 | 321241001324244123230 |
6 | 3130202030540455544 |
7 | 126362261205010300 |
oct | 11305375524257330 |
9 | 1538223241275281 |
10 | 330231132020440 |
11 | 96249266a10492 |
12 | 31055009b4a5b4 |
13 | 1123587b90a7b1 |
14 | 5b793b47c4600 |
15 | 282a109c945ca |
hex | 12c57ed515ed8 |
330231132020440 has 96 divisors (see below), whose sum is σ = 864343571451120. Its totient is φ = 113220251596032.
The previous prime is 330231132020407. The next prime is 330231132020441. The reversal of 330231132020440 is 44020231132033.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 330231132020399 and 330231132020408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330231132020441) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 121344327 + ... + 124035913.
Almost surely, 2330231132020440 is an apocalyptic number.
It is an amenable number.
330231132020440 is an abundant number, since it is smaller than the sum of its proper divisors (534112439430680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
330231132020440 is a wasteful number, since it uses less digits than its factorization.
330231132020440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2754209 (or 2754198 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 330231132020440 its reverse (44020231132033), we get a palindrome (374251363152473).
The spelling of 330231132020440 in words is "three hundred thirty trillion, two hundred thirty-one billion, one hundred thirty-two million, twenty thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •