Base | Representation |
---|---|
bin | 1101100101110101… |
… | …0110001010110100 |
3 | 100102021000022202120 |
4 | 3121131112022310 |
5 | 24432434130402 |
6 | 1402004435540 |
7 | 156260311401 |
oct | 33135261264 |
9 | 10367008676 |
10 | 3648348852 |
11 | 1602441545 |
12 | 8599a8bb0 |
13 | 461b0ab05 |
14 | 2687772a8 |
15 | 1654623bc |
hex | d97562b4 |
3648348852 has 24 divisors (see below), whose sum is σ = 9013568256. Its totient is φ = 1144579968.
The previous prime is 3648348841. The next prime is 3648348853. The reversal of 3648348852 is 2588438463.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 3648348795 and 3648348804.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3648348853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8941828 + ... + 8942235.
It is an arithmetic number, because the mean of its divisors is an integer number (375565344).
Almost surely, 23648348852 is an apocalyptic number.
It is an amenable number.
3648348852 is an abundant number, since it is smaller than the sum of its proper divisors (5365219404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3648348852 is a wasteful number, since it uses less digits than its factorization.
3648348852 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17884087 (or 17884085 counting only the distinct ones).
The product of its digits is 4423680, while the sum is 51.
The square root of 3648348852 is about 60401.5633241392. The cubic root of 3648348852 is about 1539.4495210240.
The spelling of 3648348852 in words is "three billion, six hundred forty-eight million, three hundred forty-eight thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •