Base | Representation |
---|---|
bin | 111111001011110100000… |
… | …001100101000000101001 |
3 | 120101002111012202211122221 |
4 | 333023310001211000221 |
5 | 1032114414310222101 |
6 | 13122405313114041 |
7 | 625462036512322 |
oct | 77136401450051 |
9 | 16332435684587 |
10 | 4342011023401 |
11 | 1424489032617 |
12 | 5a1616858921 |
13 | 2565b051356c |
14 | 110223b77449 |
15 | 77e2b98eaa1 |
hex | 3f2f4065029 |
4342011023401 has 2 divisors, whose sum is σ = 4342011023402. Its totient is φ = 4342011023400.
The previous prime is 4342011023291. The next prime is 4342011023437. The reversal of 4342011023401 is 1043201102434.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3740835647376 + 601175376025 = 1934124^2 + 775355^2 .
It is a cyclic number.
It is not a de Polignac number, because 4342011023401 - 29 = 4342011022889 is a prime.
It is not a weakly prime, because it can be changed into another prime (4342011023201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2171005511700 + 2171005511701.
It is an arithmetic number, because the mean of its divisors is an integer number (2171005511701).
Almost surely, 24342011023401 is an apocalyptic number.
It is an amenable number.
4342011023401 is a deficient number, since it is larger than the sum of its proper divisors (1).
4342011023401 is an equidigital number, since it uses as much as digits as its factorization.
4342011023401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 4342011023401 its reverse (1043201102434), we get a palindrome (5385212125835).
The spelling of 4342011023401 in words is "four trillion, three hundred forty-two billion, eleven million, twenty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •