Base | Representation |
---|---|
bin | 1001101001100011010… |
… | …00000100100001010000 |
3 | 1011200202221112121020000 |
4 | 10310301220010201100 |
5 | 20413001014212043 |
6 | 412150521250000 |
7 | 32644665410412 |
oct | 4646150044120 |
9 | 1150687477200 |
10 | 331545069648 |
11 | 118675603aa1 |
12 | 54309933900 |
13 | 253593361b0 |
14 | 120928629b2 |
15 | 8956c862d3 |
hex | 4d31a04850 |
331545069648 has 100 divisors (see below), whose sum is σ = 1033402105428. Its totient is φ = 102013862400.
The previous prime is 331545069637. The next prime is 331545069749. The reversal of 331545069648 is 846960545133.
331545069648 is a `hidden beast` number, since 3 + 3 + 1 + 5 + 4 + 506 + 96 + 48 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 191854512144 + 139690557504 = 438012^2 + 373752^2 .
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 331545069594 and 331545069603.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 9822453 + ... + 9856148.
Almost surely, 2331545069648 is an apocalyptic number.
It is an amenable number.
331545069648 is an abundant number, since it is smaller than the sum of its proper divisors (701857035780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331545069648 is a wasteful number, since it uses less digits than its factorization.
331545069648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19678634 (or 19678619 counting only the distinct ones).
The product of its (nonzero) digits is 9331200, while the sum is 54.
The spelling of 331545069648 in words is "three hundred thirty-one billion, five hundred forty-five million, sixty-nine thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •