Base | Representation |
---|---|
bin | 1001010000111010… |
… | …1000011100100100 |
3 | 20102022110202121012 |
4 | 2110032220130210 |
5 | 20043114114102 |
6 | 1050434041352 |
7 | 115424664230 |
oct | 22416503444 |
9 | 6368422535 |
10 | 2486863652 |
11 | 1066851519 |
12 | 594a19258 |
13 | 3082b0170 |
14 | 1983d15c0 |
15 | e84d3752 |
hex | 943a8724 |
2486863652 has 48 divisors (see below), whose sum is σ = 5397313152. Its totient is φ = 976285440.
The previous prime is 2486863627. The next prime is 2486863681. The reversal of 2486863652 is 2563686842.
It is a self number, because there is not a number n which added to its sum of digits gives 2486863652.
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 15 ways as a sum of consecutive naturals, for example, 21608 + ... + 73760.
It is an arithmetic number, because the mean of its divisors is an integer number (112444024).
Almost surely, 22486863652 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2486863652, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2698656576).
2486863652 is an abundant number, since it is smaller than the sum of its proper divisors (2910449500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2486863652 is a wasteful number, since it uses less digits than its factorization.
2486863652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52308 (or 52306 counting only the distinct ones).
The product of its digits is 3317760, while the sum is 50.
The square root of 2486863652 is about 49868.4635014956. The cubic root of 2486863652 is about 1354.8274634958.
The spelling of 2486863652 in words is "two billion, four hundred eighty-six million, eight hundred sixty-three thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •