Base | Representation |
---|---|
bin | 111100001101101… |
… | …010010011110101 |
3 | 2121101220012021021 |
4 | 330031222103311 |
5 | 4032103323013 |
6 | 244124221141 |
7 | 34014451465 |
oct | 7415522365 |
9 | 2541805237 |
10 | 1010214133 |
11 | 47926a915 |
12 | 24239a7b1 |
13 | 1313a5356 |
14 | 98249ba5 |
15 | 5da4ca8d |
hex | 3c36a4f5 |
1010214133 has 2 divisors, whose sum is σ = 1010214134. Its totient is φ = 1010214132.
The previous prime is 1010214113. The next prime is 1010214187. The reversal of 1010214133 is 3314120101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 998117649 + 12096484 = 31593^2 + 3478^2 .
It is an emirp because it is prime and its reverse (3314120101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1010214133 - 221 = 1008116981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010214113) 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 as a sum of consecutive naturals, namely, 505107066 + 505107067.
It is an arithmetic number, because the mean of its divisors is an integer number (505107067).
Almost surely, 21010214133 is an apocalyptic number.
It is an amenable number.
1010214133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010214133 is an equidigital number, since it uses as much as digits as its factorization.
1010214133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1010214133 is about 31783.8659228232. The cubic root of 1010214133 is about 1003.3931842778.
Adding to 1010214133 its reverse (3314120101), we get a palindrome (4324334234).
The spelling of 1010214133 in words is "one billion, ten million, two hundred fourteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •