Base | Representation |
---|---|
bin | 1100000111110011… |
… | …1110001000000000 |
3 | 22101202221121100022 |
4 | 3001330332020000 |
5 | 23131010021132 |
6 | 1254520113012 |
7 | 143431265021 |
oct | 30174761000 |
9 | 8352847308 |
10 | 3253985792 |
11 | 141a876762 |
12 | 769905768 |
13 | 3cb1c11a5 |
14 | 22c23cc48 |
15 | 140a13e12 |
hex | c1f3e200 |
3253985792 has 30 divisors (see below), whose sum is σ = 6504196149. Its totient is φ = 1626347520.
The previous prime is 3253985767. The next prime is 3253985879. The reversal of 3253985792 is 2975893523.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 1718599936 + 1535385856 = 41456^2 + 39184^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=40336.
It is a Duffinian number.
It is an unprimeable number.
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 2 ways as a sum of consecutive naturals, for example, 1289492 + ... + 1292012.
Almost surely, 23253985792 is an apocalyptic number.
3253985792 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
3253985792 is a deficient number, since it is larger than the sum of its proper divisors (3250210357).
3253985792 is an frugal number, since it uses more digits than its factorization.
3253985792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5060 (or 2523 counting only the distinct ones).
The product of its digits is 4082400, while the sum is 53.
The square root of 3253985792 is about 57043.7182518812. The cubic root of 3253985792 is about 1481.8533198118.
The spelling of 3253985792 in words is "three billion, two hundred fifty-three million, nine hundred eighty-five thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •