Base | Representation |
---|---|
bin | 1111011011110011… |
… | …0100111000110001 |
3 | 101200202001100011111 |
4 | 3312330310320301 |
5 | 31441120443101 |
6 | 1523041513321 |
7 | 204446053351 |
oct | 36674647061 |
9 | 11622040144 |
10 | 4143140401 |
11 | 1836770784 |
12 | 977642841 |
13 | 51048b28a |
14 | 2b4374b61 |
15 | 193aec251 |
hex | f6f34e31 |
4143140401 has 2 divisors, whose sum is σ = 4143140402. Its totient is φ = 4143140400.
The previous prime is 4143140389. The next prime is 4143140479. The reversal of 4143140401 is 1040413414.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3726980401 + 416160000 = 61049^2 + 20400^2 .
It is a cyclic number.
It is not a de Polignac number, because 4143140401 - 27 = 4143140273 is a prime.
It is a super-2 number, since 2×41431404012 = 34331224764796881602, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4143140101) 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, 2071570200 + 2071570201.
It is an arithmetic number, because the mean of its divisors is an integer number (2071570201).
Almost surely, 24143140401 is an apocalyptic number.
It is an amenable number.
4143140401 is a deficient number, since it is larger than the sum of its proper divisors (1).
4143140401 is an equidigital number, since it uses as much as digits as its factorization.
4143140401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 4143140401 is about 64367.2308010839. The cubic root of 4143140401 is about 1606.1146749968.
Adding to 4143140401 its reverse (1040413414), we get a palindrome (5183553815).
The spelling of 4143140401 in words is "four billion, one hundred forty-three million, one hundred forty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •