Base | Representation |
---|---|
bin | 111110111101111… |
… | …011111000110111 |
3 | 2201121211212120112 |
4 | 332331323320313 |
5 | 4130421022404 |
6 | 252454453235 |
7 | 35115310556 |
oct | 7675737067 |
9 | 2647755515 |
10 | 1056423479 |
11 | 4a2361661 |
12 | 25596421b |
13 | 13ab34267 |
14 | a0437d9d |
15 | 62b2956e |
hex | 3ef7be37 |
1056423479 has 2 divisors, whose sum is σ = 1056423480. Its totient is φ = 1056423478.
The previous prime is 1056423457. The next prime is 1056423493. The reversal of 1056423479 is 9743246501.
It is a strong prime.
It is an emirp because it is prime and its reverse (9743246501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1056423479 - 216 = 1056357943 is a prime.
It is a super-2 number, since 2×10564234792 = 2232061133964926882, which contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1056423449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528211739 + 528211740.
It is an arithmetic number, because the mean of its divisors is an integer number (528211740).
Almost surely, 21056423479 is an apocalyptic number.
1056423479 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056423479 is an equidigital number, since it uses as much as digits as its factorization.
1056423479 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 181440, while the sum is 41.
The square root of 1056423479 is about 32502.6687981156. The cubic root of 1056423479 is about 1018.4647797323.
It can be divided in two parts, 10564 and 23479, that added together give a palindrome (34043).
The spelling of 1056423479 in words is "one billion, fifty-six million, four hundred twenty-three thousand, four hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •