Base | Representation |
---|---|
bin | 1001011101010001001… |
… | …01101111111000011100 |
3 | 1011001202101122220200120 |
4 | 10232220211233320130 |
5 | 20310444424434230 |
6 | 405140323554540 |
7 | 32322406024206 |
oct | 4565045577034 |
9 | 1131671586616 |
10 | 324951014940 |
11 | 1158a1416102 |
12 | 52b8952ba50 |
13 | 24848173986 |
14 | 11a28bb7776 |
15 | 86bce07310 |
hex | 4ba896fe1c |
324951014940 has 24 divisors (see below), whose sum is σ = 909862842000. Its totient is φ = 86653603968.
The previous prime is 324951014923. The next prime is 324951014953. The reversal of 324951014940 is 49410159423.
It is a super-2 number, since 2×3249510149402 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 324951014892 and 324951014901.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2707925065 + ... + 2707925184.
It is an arithmetic number, because the mean of its divisors is an integer number (37910951750).
Almost surely, 2324951014940 is an apocalyptic number.
324951014940 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
324951014940 is an abundant number, since it is smaller than the sum of its proper divisors (584911827060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
324951014940 is a wasteful number, since it uses less digits than its factorization.
324951014940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5415850261 (or 5415850259 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 42.
The spelling of 324951014940 in words is "three hundred twenty-four billion, nine hundred fifty-one million, fourteen thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •