Base | Representation |
---|---|
bin | 111110110100010… |
… | …111110001111001 |
3 | 2201110010111100100 |
4 | 332310113301321 |
5 | 4124300310111 |
6 | 252325030013 |
7 | 35055066135 |
oct | 7664276171 |
9 | 2643114310 |
10 | 1053916281 |
11 | 4a09a99a0 |
12 | 254b55309 |
13 | 13a467002 |
14 | 9dd843c5 |
15 | 627d1756 |
hex | 3ed17c79 |
1053916281 has 48 divisors (see below), whose sum is σ = 1741409280. Its totient is φ = 607976160.
The previous prime is 1053916271. The next prime is 1053916307. The reversal of 1053916281 is 1826193501.
It is not a de Polignac number, because 1053916281 - 27 = 1053916153 is a prime.
It is a super-2 number, since 2×10539162812 = 2221479054713741922, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1053916211) 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 47 ways as a sum of consecutive naturals, for example, 515860 + ... + 517898.
It is an arithmetic number, because the mean of its divisors is an integer number (36279360).
Almost surely, 21053916281 is an apocalyptic number.
1053916281 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1053916281 is a deficient number, since it is larger than the sum of its proper divisors (687492999).
1053916281 is a wasteful number, since it uses less digits than its factorization.
1053916281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2306 (or 2303 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 36.
The square root of 1053916281 is about 32464.0767772626. The cubic root of 1053916281 is about 1017.6584378199.
The spelling of 1053916281 in words is "one billion, fifty-three million, nine hundred sixteen thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •