Base | Representation |
---|---|
bin | 1001011110000100100… |
… | …00000110100101000000 |
3 | 1011002212101210021111111 |
4 | 10233002100012211000 |
5 | 20312340134021402 |
6 | 405251143453104 |
7 | 32336154345520 |
oct | 4570220064500 |
9 | 1132771707444 |
10 | 325381548352 |
11 | 115aa2446243 |
12 | 53089757194 |
13 | 248b6415c83 |
14 | 11a6a049680 |
15 | 86e5aec9d7 |
hex | 4bc2406940 |
325381548352 has 56 divisors (see below), whose sum is σ = 737974566720. Its totient is φ = 139438709760.
The previous prime is 325381548329. The next prime is 325381548353. The reversal of 325381548352 is 253845183523.
It is a tau number, because it is divible by the number of its divisors (56).
It is a junction number, because it is equal to n+sod(n) for n = 325381548296 and 325381548305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (325381548353) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 10023027 + ... + 10055437.
Almost surely, 2325381548352 is an apocalyptic number.
325381548352 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
325381548352 is an abundant number, since it is smaller than the sum of its proper divisors (412593018368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
325381548352 is a wasteful number, since it uses less digits than its factorization.
325381548352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54839 (or 54829 counting only the distinct ones).
The product of its digits is 3456000, while the sum is 49.
The spelling of 325381548352 in words is "three hundred twenty-five billion, three hundred eighty-one million, five hundred forty-eight thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •