Base | Representation |
---|---|
bin | 111010100010000011111… |
… | …100010101010001100101 |
3 | 112020112021012202111212212 |
4 | 322202003330111101211 |
5 | 1011400134033121013 |
6 | 12315453121053205 |
7 | 563413263360326 |
oct | 72420374252145 |
9 | 15215235674785 |
10 | 4022303020133 |
11 | 1310938214812 |
12 | 54b671187205 |
13 | 2323bc665078 |
14 | dc97543c44d |
15 | 6e968ee26a8 |
hex | 3a883f15465 |
4022303020133 has 2 divisors, whose sum is σ = 4022303020134. Its totient is φ = 4022303020132.
The previous prime is 4022303020111. The next prime is 4022303020157. The reversal of 4022303020133 is 3310203032204.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3736481268004 + 285821752129 = 1932998^2 + 534623^2 .
It is a cyclic number.
It is not a de Polignac number, because 4022303020133 - 210 = 4022303019109 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4022303020099 and 4022303020108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4022303020103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2011151510066 + 2011151510067.
It is an arithmetic number, because the mean of its divisors is an integer number (2011151510067).
Almost surely, 24022303020133 is an apocalyptic number.
It is an amenable number.
4022303020133 is a deficient number, since it is larger than the sum of its proper divisors (1).
4022303020133 is an equidigital number, since it uses as much as digits as its factorization.
4022303020133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 4022303020133 its reverse (3310203032204), we get a palindrome (7332506052337).
The spelling of 4022303020133 in words is "four trillion, twenty-two billion, three hundred three million, twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •