Base | Representation |
---|---|
bin | 101111001011110001001… |
… | …001110100101111001001 |
3 | 102110222100000000122202022 |
4 | 233023301021310233021 |
5 | 411111020003204140 |
6 | 10521321142414225 |
7 | 453154651446050 |
oct | 57136111645711 |
9 | 12428300018668 |
10 | 3242451225545 |
11 | 1040130205a54 |
12 | 4444aa431375 |
13 | 1a69b99b443c |
14 | b2d14d3b397 |
15 | 595249940b5 |
hex | 2f2f1274bc9 |
3242451225545 has 32 divisors (see below), whose sum is σ = 4455922924800. Its totient is φ = 2218831128576.
The previous prime is 3242451225539. The next prime is 3242451225593. The reversal of 3242451225545 is 5455221542423.
It is a cyclic number.
It is not a de Polignac number, because 3242451225545 - 228 = 3242182790089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3242451225496 and 3242451225505.
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 31 ways as a sum of consecutive naturals, for example, 72846737 + ... + 72891233.
It is an arithmetic number, because the mean of its divisors is an integer number (139247591400).
Almost surely, 23242451225545 is an apocalyptic number.
3242451225545 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
3242451225545 is a deficient number, since it is larger than the sum of its proper divisors (1213471699255).
3242451225545 is a wasteful number, since it uses less digits than its factorization.
3242451225545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48737.
The product of its digits is 1920000, while the sum is 44.
Adding to 3242451225545 its reverse (5455221542423), we get a palindrome (8697672767968).
The spelling of 3242451225545 in words is "three trillion, two hundred forty-two billion, four hundred fifty-one million, two hundred twenty-five thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •