Base | Representation |
---|---|
bin | 111100111100110… |
… | …000011110000101 |
3 | 2122021010102210112 |
4 | 330330300132011 |
5 | 4043233411013 |
6 | 245245002405 |
7 | 34224421610 |
oct | 7474603605 |
9 | 2567112715 |
10 | 1022560133 |
11 | 485232621 |
12 | 246553405 |
13 | 133b0898a |
14 | 99b41177 |
15 | 5eb8aba8 |
hex | 3cf30785 |
1022560133 has 4 divisors (see below), whose sum is σ = 1168640160. Its totient is φ = 876480108.
The previous prime is 1022560117. The next prime is 1022560139. The reversal of 1022560133 is 3310652201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3310652201 = 277 ⋅11951813.
It is not a de Polignac number, because 1022560133 - 24 = 1022560117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1022560099 and 1022560108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022560139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 73040003 + ... + 73040016.
It is an arithmetic number, because the mean of its divisors is an integer number (292160040).
Almost surely, 21022560133 is an apocalyptic number.
It is an amenable number.
1022560133 is a deficient number, since it is larger than the sum of its proper divisors (146080027).
1022560133 is an equidigital number, since it uses as much as digits as its factorization.
1022560133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146080026.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 1022560133 is about 31977.4941638647. The cubic root of 1022560133 is about 1007.4641915574.
The spelling of 1022560133 in words is "one billion, twenty-two million, five hundred sixty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •