Base | Representation |
---|---|
bin | 111110111101110… |
… | …111000000000101 |
3 | 2201121210212010010 |
4 | 332331313000011 |
5 | 4130414402321 |
6 | 252454220433 |
7 | 35115165321 |
oct | 7675670005 |
9 | 2647725103 |
10 | 1056403461 |
11 | 4a2348613 |
12 | 255954719 |
13 | 13ab28109 |
14 | a0430981 |
15 | 62b23676 |
hex | 3ef77005 |
1056403461 has 8 divisors (see below), whose sum is σ = 1453974784. Its totient is φ = 681550560.
The previous prime is 1056403433. The next prime is 1056403471. The reversal of 1056403461 is 1643046501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1056403461 - 211 = 1056401413 is a prime.
It is a super-2 number, since 2×10564034612 = 2231976544825557042, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1056403421) 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, 5679496 + ... + 5679681.
It is an arithmetic number, because the mean of its divisors is an integer number (181746848).
Almost surely, 21056403461 is an apocalyptic number.
It is an amenable number.
1056403461 is a deficient number, since it is larger than the sum of its proper divisors (397571323).
1056403461 is a wasteful number, since it uses less digits than its factorization.
1056403461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11359211.
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 1056403461 is about 32502.3608527135. The cubic root of 1056403461 is about 1018.4583467828.
Adding to 1056403461 its reverse (1643046501), we get a palindrome (2699449962).
The spelling of 1056403461 in words is "one billion, fifty-six million, four hundred three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •