Base | Representation |
---|---|
bin | 111110111100000… |
… | …101011001011001 |
3 | 2201120221012210220 |
4 | 332330011121121 |
5 | 4130310010022 |
6 | 252440230253 |
7 | 35111216562 |
oct | 7674053131 |
9 | 2646835726 |
10 | 1055938137 |
11 | 4a205aa51 |
12 | 25576b389 |
13 | 13a9c4387 |
14 | a034d169 |
15 | 62a8085c |
hex | 3ef05659 |
1055938137 has 4 divisors (see below), whose sum is σ = 1407917520. Its totient is φ = 703958756.
The previous prime is 1055938123. The next prime is 1055938139. The reversal of 1055938137 is 7318395501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1055938137 - 212 = 1055934041 is a prime.
It is a super-2 number, since 2×10559381372 = 2230010698342061538, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1055938139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 175989687 + ... + 175989692.
It is an arithmetic number, because the mean of its divisors is an integer number (351979380).
Almost surely, 21055938137 is an apocalyptic number.
It is an amenable number.
1055938137 is a deficient number, since it is larger than the sum of its proper divisors (351979383).
1055938137 is an equidigital number, since it uses as much as digits as its factorization.
1055938137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351979382.
The product of its (nonzero) digits is 113400, while the sum is 42.
The square root of 1055938137 is about 32495.2017534897. The cubic root of 1055938137 is about 1018.3087881690.
The spelling of 1055938137 in words is "one billion, fifty-five million, nine hundred thirty-eight thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •