Base | Representation |
---|---|
bin | 1101110101010… |
… | …00011000010101 |
3 | 22002100002102012 |
4 | 12322220120111 |
5 | 214201024140 |
6 | 15302554005 |
7 | 2606156522 |
oct | 672503025 |
9 | 262302365 |
10 | 116033045 |
11 | 5a552387 |
12 | 32a38905 |
13 | 1b06840b |
14 | 115a6149 |
15 | a2c0265 |
hex | 6ea8615 |
116033045 has 8 divisors (see below), whose sum is σ = 145293696. Its totient is φ = 88790416.
The previous prime is 116033023. The next prime is 116033063. The reversal of 116033045 is 540330611.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116033045 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 116033045.
It is a congruent number.
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, 504377 + ... + 504606.
It is an arithmetic number, because the mean of its divisors is an integer number (18161712).
Almost surely, 2116033045 is an apocalyptic number.
It is an amenable number.
116033045 is a deficient number, since it is larger than the sum of its proper divisors (29260651).
116033045 is a wasteful number, since it uses less digits than its factorization.
116033045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1009011.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 116033045 is about 10771.8635806438. The cubic root of 116033045 is about 487.7462021791.
Adding to 116033045 its reverse (540330611), we get a palindrome (656363656).
The spelling of 116033045 in words is "one hundred sixteen million, thirty-three thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •