Base | Representation |
---|---|
bin | 111101001000110010010… |
… | …100000011011100110101 |
3 | 112212122100100210201100121 |
4 | 331020302110003130311 |
5 | 1022313301431231201 |
6 | 12534021042011541 |
7 | 612351451623136 |
oct | 75106224033465 |
9 | 15778310721317 |
10 | 4201322133301 |
11 | 137a8528a8117 |
12 | 57a2b2346bb1 |
13 | 24624c001cb7 |
14 | 1074b8c63c8d |
15 | 744455429a1 |
hex | 3d232503735 |
4201322133301 has 2 divisors, whose sum is σ = 4201322133302. Its totient is φ = 4201322133300.
The previous prime is 4201322133289. The next prime is 4201322133331. The reversal of 4201322133301 is 1033312231024.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2955129464401 + 1246192668900 = 1719049^2 + 1116330^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4201322133301 is a prime.
It is a super-2 number, since 2×42013221333012 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4201322133331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2100661066650 + 2100661066651.
It is an arithmetic number, because the mean of its divisors is an integer number (2100661066651).
Almost surely, 24201322133301 is an apocalyptic number.
It is an amenable number.
4201322133301 is a deficient number, since it is larger than the sum of its proper divisors (1).
4201322133301 is an equidigital number, since it uses as much as digits as its factorization.
4201322133301 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 25.
Adding to 4201322133301 its reverse (1033312231024), we get a palindrome (5234634364325).
The spelling of 4201322133301 in words is "four trillion, two hundred one billion, three hundred twenty-two million, one hundred thirty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •