Base | Representation |
---|---|
bin | 111110011010001… |
… | …101001010010111 |
3 | 2200222020000020122 |
4 | 332122031022113 |
5 | 4121021311142 |
6 | 251522022155 |
7 | 34642560311 |
oct | 7632151227 |
9 | 2628200218 |
10 | 1047057047 |
11 | 498044503 |
12 | 2527a795b |
13 | 138c04baa |
14 | 9d0ba7b1 |
15 | 61dc91d2 |
hex | 3e68d297 |
1047057047 has 8 divisors (see below), whose sum is σ = 1109922912. Its totient is φ = 984332800.
The previous prime is 1047056993. The next prime is 1047057049. The reversal of 1047057047 is 7407507401.
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 1047057047 - 214 = 1047040663 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1047056998 and 1047057016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1047057049) 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 7 ways as a sum of consecutive naturals, for example, 19979 + ... + 49932.
It is an arithmetic number, because the mean of its divisors is an integer number (138740364).
Almost surely, 21047057047 is an apocalyptic number.
1047057047 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
1047057047 is a deficient number, since it is larger than the sum of its proper divisors (62865865).
1047057047 is an equidigital number, since it uses as much as digits as its factorization.
1047057047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70809.
The product of its (nonzero) digits is 27440, while the sum is 35.
The square root of 1047057047 is about 32358.2608772474. The cubic root of 1047057047 is about 1015.4458788262.
The spelling of 1047057047 in words is "one billion, forty-seven million, fifty-seven thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •