Base | Representation |
---|---|
bin | 1101110011001… |
… | …00000001011101 |
3 | 22001210212100010 |
4 | 12321210001131 |
5 | 214113044203 |
6 | 15252553433 |
7 | 2603612313 |
oct | 671440135 |
9 | 261725303 |
10 | 115753053 |
11 | 5a380a89 |
12 | 32922879 |
13 | 1ac9ab40 |
14 | 115320b3 |
15 | a267303 |
hex | 6e6405d |
115753053 has 8 divisors (see below), whose sum is σ = 166209568. Its totient is φ = 71232624.
The previous prime is 115753031. The next prime is 115753087. The reversal of 115753053 is 350357511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 115753053 - 25 = 115753021 is a prime.
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 115753053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115753003) by changing a digit.
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, 1483975 + ... + 1484052.
It is an arithmetic number, because the mean of its divisors is an integer number (20776196).
Almost surely, 2115753053 is an apocalyptic number.
115753053 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
115753053 is a deficient number, since it is larger than the sum of its proper divisors (50456515).
115753053 is a wasteful number, since it uses less digits than its factorization.
115753053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2968043.
The product of its (nonzero) digits is 7875, while the sum is 30.
The square root of 115753053 is about 10758.8592796820. The cubic root of 115753053 is about 487.3535696964.
The spelling of 115753053 in words is "one hundred fifteen million, seven hundred fifty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •