Base | Representation |
---|---|
bin | 111110111001011… |
… | …101010101010011 |
3 | 2201112122020111222 |
4 | 332321131111103 |
5 | 4130120442442 |
6 | 252413355255 |
7 | 35102321606 |
oct | 7671352523 |
9 | 2645566458 |
10 | 1055249747 |
11 | 4a172a832 |
12 | 255498b2b |
13 | 13a812c46 |
14 | a021033d |
15 | 629968d2 |
hex | 3ee5d553 |
1055249747 has 4 divisors (see below), whose sum is σ = 1056118056. Its totient is φ = 1054381440.
The previous prime is 1055249743. The next prime is 1055249749. The reversal of 1055249747 is 7479425501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1055249747 - 22 = 1055249743 is a prime.
It is a super-2 number, since 2×10552497472 = 2227104057087128018, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1055249698 and 1055249707.
It is not an unprimeable number, because it can be changed into a prime (1055249743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 432329 + ... + 434762.
It is an arithmetic number, because the mean of its divisors is an integer number (264029514).
Almost surely, 21055249747 is an apocalyptic number.
1055249747 is a deficient number, since it is larger than the sum of its proper divisors (868309).
1055249747 is an equidigital number, since it uses as much as digits as its factorization.
1055249747 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 868308.
The product of its (nonzero) digits is 352800, while the sum is 44.
The square root of 1055249747 is about 32484.6078474098. The cubic root of 1055249747 is about 1018.0874538728.
The spelling of 1055249747 in words is "one billion, fifty-five million, two hundred forty-nine thousand, seven hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •