Base | Representation |
---|---|
bin | 1111000000101… |
… | …01100100110101 |
3 | 22202221021022212 |
4 | 13200111210311 |
5 | 224213324433 |
6 | 20254503205 |
7 | 3056165252 |
oct | 740254465 |
9 | 282837285 |
10 | 125917493 |
11 | 65093749 |
12 | 36204b05 |
13 | 201194c0 |
14 | 12a1a429 |
15 | b0c3d48 |
hex | 7815935 |
125917493 has 8 divisors (see below), whose sum is σ = 136872288. Its totient is φ = 115143984.
The previous prime is 125917489. The next prime is 125917501. The reversal of 125917493 is 394719521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 125917493 - 22 = 125917489 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 125917493.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125917403) 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, 43871 + ... + 46652.
It is an arithmetic number, because the mean of its divisors is an integer number (17109036).
Almost surely, 2125917493 is an apocalyptic number.
125917493 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
125917493 is a deficient number, since it is larger than the sum of its proper divisors (10954795).
125917493 is a wasteful number, since it uses less digits than its factorization.
125917493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90643.
The product of its digits is 68040, while the sum is 41.
The square root of 125917493 is about 11221.2964046050. The cubic root of 125917493 is about 501.2203431023.
The spelling of 125917493 in words is "one hundred twenty-five million, nine hundred seventeen thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •