Base | Representation |
---|---|
bin | 1101110010110… |
… | …00001101001100 |
3 | 22001201101221111 |
4 | 12321120031030 |
5 | 214110022102 |
6 | 15251541404 |
7 | 2603321230 |
oct | 671301514 |
9 | 261641844 |
10 | 115704652 |
11 | 5a348688 |
12 | 328ba864 |
13 | 1ac81abb |
14 | 1151c5c0 |
15 | a257cd7 |
hex | 6e5834c |
115704652 has 24 divisors (see below), whose sum is σ = 245022624. Its totient is φ = 46670592.
The previous prime is 115704643. The next prime is 115704689. The reversal of 115704652 is 256407511.
It is a super-2 number, since 2×1157046522 = 26775132988882208, which contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 121063 + ... + 122014.
It is an arithmetic number, because the mean of its divisors is an integer number (10209276).
Almost surely, 2115704652 is an apocalyptic number.
It is an amenable number.
115704652 is an abundant number, since it is smaller than the sum of its proper divisors (129317972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115704652 is a wasteful number, since it uses less digits than its factorization.
115704652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243105 (or 243103 counting only the distinct ones).
The product of its (nonzero) digits is 8400, while the sum is 31.
The square root of 115704652 is about 10756.6096889308. The cubic root of 115704652 is about 487.2856328601.
The spelling of 115704652 in words is "one hundred fifteen million, seven hundred four thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •