Base | Representation |
---|---|
bin | 111100100101111… |
… | …0001111000001101 |
3 | 12020200200202102221 |
4 | 1321023301320031 |
5 | 13130440143041 |
6 | 533425015341 |
7 | 101245220455 |
oct | 17113617015 |
9 | 5220622387 |
10 | 2033131021 |
11 | 953716479 |
12 | 488a84551 |
13 | 2652a750c |
14 | 154040d65 |
15 | bd7592d1 |
hex | 792f1e0d |
2033131021 has 2 divisors, whose sum is σ = 2033131022. Its totient is φ = 2033131020.
The previous prime is 2033130991. The next prime is 2033131033. The reversal of 2033131021 is 1201313302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1175461225 + 857669796 = 34285^2 + 29286^2 .
It is a cyclic number.
It is not a de Polignac number, because 2033131021 - 25 = 2033130989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2033130986 and 2033131004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2033132021) 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, 1016565510 + 1016565511.
It is an arithmetic number, because the mean of its divisors is an integer number (1016565511).
Almost surely, 22033131021 is an apocalyptic number.
It is an amenable number.
2033131021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2033131021 is an equidigital number, since it uses as much as digits as its factorization.
2033131021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 2033131021 is about 45090.2541687225. The cubic root of 2033131021 is about 1266.8400621890.
Adding to 2033131021 its reverse (1201313302), we get a palindrome (3234444323).
The spelling of 2033131021 in words is "two billion, thirty-three million, one hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •