Base | Representation |
---|---|
bin | 101111010001111100001… |
… | …001011100001001100000 |
3 | 102111121102211201001000111 |
4 | 233101330021130021200 |
5 | 411213103000001102 |
6 | 10524334512101104 |
7 | 453511120250056 |
oct | 57217411341140 |
9 | 12447384631014 |
10 | 3249078125152 |
11 | 1042a20997792 |
12 | 445839834794 |
13 | 1a7504906802 |
14 | b33830d61d6 |
15 | 597b165ecd7 |
hex | 2f47c25c260 |
3249078125152 has 48 divisors (see below), whose sum is σ = 6778142178192. Its totient is φ = 1527793274880.
The previous prime is 3249078125147. The next prime is 3249078125173. The reversal of 3249078125152 is 2515218709423.
It is a junction number, because it is equal to n+sod(n) for n = 3249078125096 and 3249078125105.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1610853 + ... + 3015460.
It is an arithmetic number, because the mean of its divisors is an integer number (141211295379).
Almost surely, 23249078125152 is an apocalyptic number.
3249078125152 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
3249078125152 is an abundant number, since it is smaller than the sum of its proper divisors (3529064053040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3249078125152 is a wasteful number, since it uses less digits than its factorization.
3249078125152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4627631 (or 4627623 counting only the distinct ones).
The product of its (nonzero) digits is 1209600, while the sum is 49.
The spelling of 3249078125152 in words is "three trillion, two hundred forty-nine billion, seventy-eight million, one hundred twenty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •