Base | Representation |
---|---|
bin | 111110111000101… |
… | …101010011100111 |
3 | 2201112021020200012 |
4 | 332320231103213 |
5 | 4130043144111 |
6 | 252405240435 |
7 | 35100542234 |
oct | 7670552347 |
9 | 2645236605 |
10 | 1055053031 |
11 | 4a1605a5a |
12 | 25540311b |
13 | 13a774546 |
14 | a019c78b |
15 | 6295848b |
hex | 3ee2d4e7 |
1055053031 has 32 divisors (see below), whose sum is σ = 1193797440. Its totient is φ = 927553536.
The previous prime is 1055053009. The next prime is 1055053049. The reversal of 1055053031 is 1303505501.
It is a cyclic number.
It is not a de Polignac number, because 1055053031 - 222 = 1050858727 is a prime.
It is a super-2 number, since 2×10550530312 = 2226273796444573922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1055052988 and 1055053006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055053001) 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 31 ways as a sum of consecutive naturals, for example, 3328085 + ... + 3328401.
It is an arithmetic number, because the mean of its divisors is an integer number (37306170).
Almost surely, 21055053031 is an apocalyptic number.
1055053031 is a deficient number, since it is larger than the sum of its proper divisors (138744409).
1055053031 is a wasteful number, since it uses less digits than its factorization.
1055053031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 563.
The product of its (nonzero) digits is 1125, while the sum is 23.
The square root of 1055053031 is about 32481.5798722907. The cubic root of 1055053031 is about 1018.0241871633.
Adding to 1055053031 its reverse (1303505501), we get a palindrome (2358558532).
The spelling of 1055053031 in words is "one billion, fifty-five million, fifty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •