Base | Representation |
---|---|
bin | 1101101101110… |
… | …11111101000010 |
3 | 22000111220000102 |
4 | 12312323331002 |
5 | 213424032032 |
6 | 15230122402 |
7 | 2565014300 |
oct | 666737502 |
9 | 260456012 |
10 | 115064642 |
11 | 59a50850 |
12 | 32650402 |
13 | 1aab96b4 |
14 | 113d3270 |
15 | a17d362 |
hex | 6dbbf42 |
115064642 has 24 divisors (see below), whose sum is σ = 219030480. Its totient is φ = 44829960.
The previous prime is 115064641. The next prime is 115064647. The reversal of 115064642 is 246460511.
It is a super-3 number, since 3×1150646423 (a number of 25 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (115064641) 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 11 ways as a sum of consecutive naturals, for example, 52292 + ... + 54447.
It is an arithmetic number, because the mean of its divisors is an integer number (9126270).
Almost surely, 2115064642 is an apocalyptic number.
115064642 is a deficient number, since it is larger than the sum of its proper divisors (103965838).
115064642 is a wasteful number, since it uses less digits than its factorization.
115064642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106766 (or 106759 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 29.
The square root of 115064642 is about 10726.8188201349. The cubic root of 115064642 is about 486.3855121105.
The spelling of 115064642 in words is "one hundred fifteen million, sixty-four thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •