Base | Representation |
---|---|
bin | 111010010111101110001… |
… | …110101111110011100001 |
3 | 112012110121111222020120002 |
4 | 322113232032233303201 |
5 | 1011204420020033101 |
6 | 12310415341225345 |
7 | 562541210514056 |
oct | 72275616576341 |
9 | 15173544866502 |
10 | 4011201330401 |
11 | 1307160640a21 |
12 | 549493262255 |
13 | 231340654aa5 |
14 | dc200c5b02d |
15 | 6e519567d6b |
hex | 3a5ee3afce1 |
4011201330401 has 2 divisors, whose sum is σ = 4011201330402. Its totient is φ = 4011201330400.
The previous prime is 4011201330373. The next prime is 4011201330439. The reversal of 4011201330401 is 1040331021104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3172758938176 + 838442392225 = 1781224^2 + 915665^2 .
It is a cyclic number.
It is not a de Polignac number, because 4011201330401 - 222 = 4011197136097 is a prime.
It is a super-2 number, since 2×40112013304012 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (4011201380401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2005600665200 + 2005600665201.
It is an arithmetic number, because the mean of its divisors is an integer number (2005600665201).
Almost surely, 24011201330401 is an apocalyptic number.
It is an amenable number.
4011201330401 is a deficient number, since it is larger than the sum of its proper divisors (1).
4011201330401 is an equidigital number, since it uses as much as digits as its factorization.
4011201330401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 4011201330401 its reverse (1040331021104), we get a palindrome (5051532351505).
The spelling of 4011201330401 in words is "four trillion, eleven billion, two hundred one million, three hundred thirty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •