Base | Representation |
---|---|
bin | 111101001011111… |
… | …111011010001001 |
3 | 2122112122022122022 |
4 | 331023333122021 |
5 | 4100244202411 |
6 | 245510334225 |
7 | 34303363202 |
oct | 7513773211 |
9 | 2575568568 |
10 | 1026553481 |
11 | 48750a908 |
12 | 24795a375 |
13 | 1348a64c5 |
14 | 9a4a05a9 |
15 | 601c8edb |
hex | 3d2ff689 |
1026553481 has 2 divisors, whose sum is σ = 1026553482. Its totient is φ = 1026553480.
The previous prime is 1026553477. The next prime is 1026553519. The reversal of 1026553481 is 1843556201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 961992256 + 64561225 = 31016^2 + 8035^2 .
It is an emirp because it is prime and its reverse (1843556201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1026553481 - 22 = 1026553477 is a prime.
It is a super-2 number, since 2×10265534812 = 2107624098706434722, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1026553421) 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, 513276740 + 513276741.
It is an arithmetic number, because the mean of its divisors is an integer number (513276741).
Almost surely, 21026553481 is an apocalyptic number.
It is an amenable number.
1026553481 is a deficient number, since it is larger than the sum of its proper divisors (1).
1026553481 is an equidigital number, since it uses as much as digits as its factorization.
1026553481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 35.
The square root of 1026553481 is about 32039.8732987507. The cubic root of 1026553481 is about 1008.7739529370.
The spelling of 1026553481 in words is "one billion, twenty-six million, five hundred fifty-three thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •