Base | Representation |
---|---|
bin | 1001101000100010100… |
… | …00111010111001110000 |
3 | 1011122101002220102002100 |
4 | 10310101100322321300 |
5 | 20410343021130112 |
6 | 412021004220400 |
7 | 32625353453160 |
oct | 4642120727160 |
9 | 1148332812070 |
10 | 331002130032 |
11 | 118417089472 |
12 | 54197b3a700 |
13 | 252a09c8552 |
14 | 120406d05a0 |
15 | 892428a2dc |
hex | 4d1143ae70 |
331002130032 has 120 divisors (see below), whose sum is σ = 1066298280320. Its totient is φ = 93891623040.
The previous prime is 331002130031. The next prime is 331002130051. The reversal of 331002130032 is 230031200133.
331002130032 is a `hidden beast` number, since 3 + 310 + 0 + 21 + 300 + 32 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 331002129987 and 331002130014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331002130031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1041094 + ... + 1321317.
Almost surely, 2331002130032 is an apocalyptic number.
It is an amenable number.
331002130032 is an abundant number, since it is smaller than the sum of its proper divisors (735296150288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331002130032 is a wasteful number, since it uses less digits than its factorization.
331002130032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2362571 (or 2362562 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 331002130032 its reverse (230031200133), we get a palindrome (561033330165).
The spelling of 331002130032 in words is "three hundred thirty-one billion, two million, one hundred thirty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •