Base | Representation |
---|---|
bin | 111110111101100… |
… | …101010100001111 |
3 | 2201121200011202020 |
4 | 332331211110033 |
5 | 4130410043043 |
6 | 252452501223 |
7 | 35114444166 |
oct | 7675452417 |
9 | 2647604666 |
10 | 1056331023 |
11 | 4a22a9150 |
12 | 25591a813 |
13 | 13ab01157 |
14 | a04123dd |
15 | 62b0be83 |
hex | 3ef6550f |
1056331023 has 64 divisors (see below), whose sum is σ = 1668086784. Its totient is φ = 587520000.
The previous prime is 1056331021. The next prime is 1056331033. The reversal of 1056331023 is 3201336501.
It is a happy number.
It is not a de Polignac number, because 1056331023 - 21 = 1056331021 is a prime.
It is a super-2 number, since 2×10563310232 = 2231670460304453058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1056330984 and 1056331002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1056331021) 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 63 ways as a sum of consecutive naturals, for example, 5835993 + ... + 5836173.
It is an arithmetic number, because the mean of its divisors is an integer number (26063856).
Almost surely, 21056331023 is an apocalyptic number.
1056331023 is a deficient number, since it is larger than the sum of its proper divisors (611755761).
1056331023 is a wasteful number, since it uses less digits than its factorization.
1056331023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 416.
The product of its (nonzero) digits is 1620, while the sum is 24.
The square root of 1056331023 is about 32501.2464837889. The cubic root of 1056331023 is about 1018.4350675545.
Adding to 1056331023 its reverse (3201336501), we get a palindrome (4257667524).
The spelling of 1056331023 in words is "one billion, fifty-six million, three hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •