Base | Representation |
---|---|
bin | 1111001000001… |
… | …10101011100001 |
3 | 22211210110000022 |
4 | 13210012223201 |
5 | 224441430212 |
6 | 20332003225 |
7 | 3100450406 |
oct | 744065341 |
9 | 284713008 |
10 | 126905057 |
11 | 656a8714 |
12 | 36600515 |
13 | 203a3b66 |
14 | 12bd62ad |
15 | b21b772 |
hex | 7906ae1 |
126905057 has 8 divisors (see below), whose sum is σ = 127958952. Its totient is φ = 125856000.
The previous prime is 126904993. The next prime is 126905087. The reversal of 126905057 is 750509621.
It can be written as a sum of positive squares in 4 ways, for example, as 1263376 + 125641681 = 1124^2 + 11209^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 126905057 - 26 = 126904993 is a prime.
It is a super-2 number, since 2×1269050572 = 32209786984346498, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (126905087) 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, 65807 + ... + 67707.
It is an arithmetic number, because the mean of its divisors is an integer number (15994869).
Almost surely, 2126905057 is an apocalyptic number.
It is an amenable number.
126905057 is a deficient number, since it is larger than the sum of its proper divisors (1053895).
126905057 is a wasteful number, since it uses less digits than its factorization.
126905057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2419.
The product of its (nonzero) digits is 18900, while the sum is 35.
The square root of 126905057 is about 11265.2144675545. The cubic root of 126905057 is about 502.5272801869.
The spelling of 126905057 in words is "one hundred twenty-six million, nine hundred five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •