Base | Representation |
---|---|
bin | 111110110100110… |
… | …011110011111101 |
3 | 2201110100022211221 |
4 | 332310303303331 |
5 | 4124312443401 |
6 | 252331313341 |
7 | 35056054654 |
oct | 7664636375 |
9 | 2643308757 |
10 | 1054031101 |
11 | 4a0a78192 |
12 | 254bab851 |
13 | 13a4a7356 |
14 | 9ddb419b |
15 | 628057a1 |
hex | 3ed33cfd |
1054031101 has 2 divisors, whose sum is σ = 1054031102. Its totient is φ = 1054031100.
The previous prime is 1054031089. The next prime is 1054031113. The reversal of 1054031101 is 1011304501.
It is a balanced prime because it is at equal distance from previous prime (1054031089) and next prime (1054031113).
It can be written as a sum of positive squares in only one way, i.e., 1044259225 + 9771876 = 32315^2 + 3126^2 .
It is a cyclic number.
It is not a de Polignac number, because 1054031101 - 29 = 1054030589 is a prime.
It is a super-2 number, since 2×10540311012 = 2221963123750544402, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1054031141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527015550 + 527015551.
It is an arithmetic number, because the mean of its divisors is an integer number (527015551).
Almost surely, 21054031101 is an apocalyptic number.
It is an amenable number.
1054031101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1054031101 is an equidigital number, since it uses as much as digits as its factorization.
1054031101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 1054031101 is about 32465.8451453216. The cubic root of 1054031101 is about 1017.6953930951.
Adding to 1054031101 its reverse (1011304501), we get a palindrome (2065335602).
The spelling of 1054031101 in words is "one billion, fifty-four million, thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •