Base | Representation |
---|---|
bin | 1010011111011101… |
… | …01101001010001000 |
3 | 112112112202021122110 |
4 | 11033232231022020 |
5 | 43013422022302 |
6 | 2330530222320 |
7 | 256403255163 |
oct | 51756551210 |
9 | 15475667573 |
10 | 5632610952 |
11 | 2430509a81 |
12 | 11124249a0 |
13 | 6b9c349b7 |
14 | 3b60d6ada |
15 | 22e766b6c |
hex | 14fbad288 |
5632610952 has 64 divisors (see below), whose sum is σ = 15694603200. Its totient is φ = 1674086400.
The previous prime is 5632610947. The next prime is 5632610953. The reversal of 5632610952 is 2590162365.
It is a super-2 number, since 2×56326109522 = 63452612273180692608, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5632610952.
It is not an unprimeable number, because it can be changed into a prime (5632610953) 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 15 ways as a sum of consecutive naturals, for example, 355549 + ... + 371052.
It is an arithmetic number, because the mean of its divisors is an integer number (245228175).
Almost surely, 25632610952 is an apocalyptic number.
It is an amenable number.
5632610952 is an abundant number, since it is smaller than the sum of its proper divisors (10061992248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5632610952 is a wasteful number, since it uses less digits than its factorization.
5632610952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 726646 (or 726642 counting only the distinct ones).
The product of its (nonzero) digits is 97200, while the sum is 39.
The square root of 5632610952 is about 75050.7225281676. The cubic root of 5632610952 is about 1779.2484046503.
The spelling of 5632610952 in words is "five billion, six hundred thirty-two million, six hundred ten thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •