Base | Representation |
---|---|
bin | 111100111011001… |
… | …111100010111101 |
3 | 2122020101021012211 |
4 | 330323033202331 |
5 | 4043133210013 |
6 | 245232300421 |
7 | 34221146305 |
oct | 7473174275 |
9 | 2566337184 |
10 | 1022163133 |
11 | 484a91322 |
12 | 2463a1711 |
13 | 1339ca074 |
14 | 99a7a605 |
15 | 5eb0d23d |
hex | 3cecf8bd |
1022163133 has 2 divisors, whose sum is σ = 1022163134. Its totient is φ = 1022163132.
The previous prime is 1022163119. The next prime is 1022163137. The reversal of 1022163133 is 3313612201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 978563524 + 43599609 = 31282^2 + 6603^2 .
It is an emirp because it is prime and its reverse (3313612201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1022163133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1022163137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511081566 + 511081567.
It is an arithmetic number, because the mean of its divisors is an integer number (511081567).
It is a self-describing number.
Almost surely, 21022163133 is an apocalyptic number.
It is an amenable number.
1022163133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022163133 is an equidigital number, since it uses as much as digits as its factorization.
1022163133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 22.
The square root of 1022163133 is about 31971.2860704727. The cubic root of 1022163133 is about 1007.3337949697. Note that the first 3 decimals are identical.
Adding to 1022163133 its reverse (3313612201), we get a palindrome (4335775334).
The spelling of 1022163133 in words is "one billion, twenty-two million, one hundred sixty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •