Base | Representation |
---|---|
bin | 1111011001011101… |
… | …1110111111101001 |
3 | 101200001122000011221 |
4 | 3312113132333221 |
5 | 31431114221101 |
6 | 1522052022041 |
7 | 204266623114 |
oct | 36627367751 |
9 | 11601560157 |
10 | 4133351401 |
11 | 18311950a3 |
12 | 974301921 |
13 | 50b44177a |
14 | 2b2d4757b |
15 | 192d16aa1 |
hex | f65defe9 |
4133351401 has 2 divisors, whose sum is σ = 4133351402. Its totient is φ = 4133351400.
The previous prime is 4133351329. The next prime is 4133351419. The reversal of 4133351401 is 1041533314.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3349631376 + 783720025 = 57876^2 + 27995^2 .
It is a cyclic number.
It is not a de Polignac number, because 4133351401 - 27 = 4133351273 is a prime.
It is not a weakly prime, because it can be changed into another prime (4133381401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2066675700 + 2066675701.
It is an arithmetic number, because the mean of its divisors is an integer number (2066675701).
Almost surely, 24133351401 is an apocalyptic number.
It is an amenable number.
4133351401 is a deficient number, since it is larger than the sum of its proper divisors (1).
4133351401 is an equidigital number, since it uses as much as digits as its factorization.
4133351401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 4133351401 is about 64291.1455878646. The cubic root of 4133351401 is about 1604.8487548141.
Adding to 4133351401 its reverse (1041533314), we get a palindrome (5174884715).
It can be divided in two parts, 413335 and 1401, that added together give a square (414736 = 6442).
The spelling of 4133351401 in words is "four billion, one hundred thirty-three million, three hundred fifty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •