Base | Representation |
---|---|
bin | 111110110000111… |
… | …101000000011111 |
3 | 2201101102222010211 |
4 | 332300331000133 |
5 | 4124033121231 |
6 | 252253513251 |
7 | 35044344466 |
oct | 7660750037 |
9 | 2641388124 |
10 | 1053020191 |
11 | 4a0447723 |
12 | 2547a2827 |
13 | 13a212192 |
14 | 9dbcd9dd |
15 | 626a5eb1 |
hex | 3ec3d01f |
1053020191 has 4 divisors (see below), whose sum is σ = 1063243792. Its totient is φ = 1042796592.
The previous prime is 1053020123. The next prime is 1053020233. The reversal of 1053020191 is 1910203501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1053020191 - 215 = 1052987423 is a prime.
It is a super-2 number, since 2×10530201912 = 2217703045307352962, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1053020291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5111646 + ... + 5111851.
It is an arithmetic number, because the mean of its divisors is an integer number (265810948).
Almost surely, 21053020191 is an apocalyptic number.
1053020191 is a deficient number, since it is larger than the sum of its proper divisors (10223601).
1053020191 is a wasteful number, since it uses less digits than its factorization.
1053020191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10223600.
The product of its (nonzero) digits is 270, while the sum is 22.
The square root of 1053020191 is about 32450.2725874529. The cubic root of 1053020191 is about 1017.3699354221.
Adding to 1053020191 its reverse (1910203501), we get a palindrome (2963223692).
The spelling of 1053020191 in words is "one billion, fifty-three million, twenty thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •