Base | Representation |
---|---|
bin | 111110111100011… |
… | …000011001111101 |
3 | 2201121002011121121 |
4 | 332330120121331 |
5 | 4130320002442 |
6 | 252442030541 |
7 | 35111662561 |
oct | 7674303175 |
9 | 2647064547 |
10 | 1056015997 |
11 | 4a21034a3 |
12 | 2557a8451 |
13 | 13aa2094a |
14 | a036d6a1 |
15 | 62a98967 |
hex | 3ef1867d |
1056015997 has 8 divisors (see below), whose sum is σ = 1102898880. Its totient is φ = 1009213920.
The previous prime is 1056015971. The next prime is 1056016007. The reversal of 1056015997 is 7995106501.
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 1056015997 - 223 = 1047627389 is a prime.
It is a super-2 number, since 2×10560159972 = 2230339571839808018, 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 (1056015907) 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 7 ways as a sum of consecutive naturals, for example, 7329 + ... + 46537.
It is an arithmetic number, because the mean of its divisors is an integer number (137862360).
Almost surely, 21056015997 is an apocalyptic number.
It is an amenable number.
1056015997 is a deficient number, since it is larger than the sum of its proper divisors (46882883).
1056015997 is a wasteful number, since it uses less digits than its factorization.
1056015997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40403.
The product of its (nonzero) digits is 85050, while the sum is 43.
The square root of 1056015997 is about 32496.3997544343. The cubic root of 1056015997 is about 1018.3338160157. Note that the first 3 decimals are identical.
The spelling of 1056015997 in words is "one billion, fifty-six million, fifteen thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •