Base | Representation |
---|---|
bin | 1101110000010… |
… | …11100000011110 |
3 | 22001010110000000 |
4 | 12320023200132 |
5 | 214014443434 |
6 | 15241115130 |
7 | 2600542302 |
oct | 670134036 |
9 | 261113000 |
10 | 115390494 |
11 | 5a15364a |
12 | 32788aa6 |
13 | 1aba1acb |
14 | 11479d02 |
15 | a1e4b99 |
hex | 6e0b81e |
115390494 has 128 divisors (see below), whose sum is σ = 287170560. Its totient is φ = 34642080.
The previous prime is 115390469. The next prime is 115390571. The reversal of 115390494 is 494093511.
It is a happy number.
It is a super-2 number, since 2×1153904942 = 26629932211128072, which contains 22 as substring.
It is a Curzon number.
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 63 ways as a sum of consecutive naturals, for example, 3118644 + ... + 3118680.
It is an arithmetic number, because the mean of its divisors is an integer number (2243520).
Almost surely, 2115390494 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 115390494, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143585280).
115390494 is an abundant number, since it is smaller than the sum of its proper divisors (171780066).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115390494 is an equidigital number, since it uses as much as digits as its factorization.
115390494 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114 (or 96 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 36.
The square root of 115390494 is about 10741.9967417608. The cubic root of 115390494 is about 486.8442117159.
The spelling of 115390494 in words is "one hundred fifteen million, three hundred ninety thousand, four hundred ninety-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •