Base | Representation |
---|---|
bin | 1011110011110… |
… | …00000111000001 |
3 | 20220101200012000 |
4 | 11321320013001 |
5 | 200324324423 |
6 | 13455054213 |
7 | 2311660110 |
oct | 571700701 |
9 | 226350160 |
10 | 99058113 |
11 | 50a08910 |
12 | 29211369 |
13 | 176a3b8b |
14 | d227c77 |
15 | 8a6a843 |
hex | 5e781c1 |
99058113 has 128 divisors (see below), whose sum is σ = 199065600. Its totient is φ = 47174400.
The previous prime is 99058103. The next prime is 99058147. The reversal of 99058113 is 31185099.
It is a happy number.
It is not a de Polignac number, because 99058113 - 25 = 99058081 is a prime.
It is a super-2 number, since 2×990581132 = 19625019502241538, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (99058103) 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 127 ways as a sum of consecutive naturals, for example, 1868995 + ... + 1869047.
It is an arithmetic number, because the mean of its divisors is an integer number (1555200).
Almost surely, 299058113 is an apocalyptic number.
99058113 is a gapful number since it is divisible by the number (93) formed by its first and last digit.
It is an amenable number.
99058113 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
99058113 is a wasteful number, since it uses less digits than its factorization.
99058113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140 (or 134 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 36.
The square root of 99058113 is about 9952.7942307676. The cubic root of 99058113 is about 462.6969998850.
The spelling of 99058113 in words is "ninety-nine million, fifty-eight thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •