Base | Representation |
---|---|
bin | 111110111101000… |
… | …110000101111011 |
3 | 2201121102200022111 |
4 | 332331012011323 |
5 | 4130342000011 |
6 | 252450033151 |
7 | 35113402264 |
oct | 7675060573 |
9 | 2647380274 |
10 | 1056203131 |
11 | 4a2221055 |
12 | 2558787b7 |
13 | 13aa87b89 |
14 | a03bb96b |
15 | 62ad4121 |
hex | 3ef4617b |
1056203131 has 2 divisors, whose sum is σ = 1056203132. Its totient is φ = 1056203130.
The previous prime is 1056203101. The next prime is 1056203153. The reversal of 1056203131 is 1313026501.
It is a happy number.
It is an a-pointer prime, because the next prime (1056203153) can be obtained adding 1056203131 to its sum of digits (22).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1056203131 - 221 = 1054105979 is a prime.
It is a super-2 number, since 2×10562031312 = 2231130107868406322, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1056203101) 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 as a sum of consecutive naturals, namely, 528101565 + 528101566.
It is an arithmetic number, because the mean of its divisors is an integer number (528101566).
Almost surely, 21056203131 is an apocalyptic number.
1056203131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056203131 is an equidigital number, since it uses as much as digits as its factorization.
1056203131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 22.
The square root of 1056203131 is about 32499.2789304624. The cubic root of 1056203131 is about 1018.3939646074.
Adding to 1056203131 its reverse (1313026501), we get a palindrome (2369229632).
The spelling of 1056203131 in words is "one billion, fifty-six million, two hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •