Base | Representation |
---|---|
bin | 1001011110011110101… |
… | …11100111010000101110 |
3 | 1011010102201220010110201 |
4 | 10233033113213100232 |
5 | 20313313003333123 |
6 | 405325044424114 |
7 | 32344466054041 |
oct | 4571727472056 |
9 | 1133381803421 |
10 | 325601621038 |
11 | 1160a56990a1 |
12 | 5312b3a803a |
13 | 2491cbaa7b5 |
14 | 11a8b374c58 |
15 | 870a0be5ad |
hex | 4bcf5e742e |
325601621038 has 32 divisors (see below), whose sum is σ = 506132969472. Its totient is φ = 156932661600.
The previous prime is 325601620997. The next prime is 325601621041. The reversal of 325601621038 is 830126106523.
It is a junction number, because it is equal to n+sod(n) for n = 325601620988 and 325601621006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25091920 + ... + 25104892.
It is an arithmetic number, because the mean of its divisors is an integer number (15816655296).
Almost surely, 2325601621038 is an apocalyptic number.
325601621038 is a deficient number, since it is larger than the sum of its proper divisors (180531348434).
325601621038 is a wasteful number, since it uses less digits than its factorization.
325601621038 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14560.
The product of its (nonzero) digits is 51840, while the sum is 37.
The spelling of 325601621038 in words is "three hundred twenty-five billion, six hundred one million, six hundred twenty-one thousand, thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •