Base | Representation |
---|---|
bin | 11010010100011011… |
… | …01011010001101001 |
3 | 1100110202002102102102 |
4 | 31022031223101221 |
5 | 212414240013001 |
6 | 10254034543145 |
7 | 1010104012124 |
oct | 151215532151 |
9 | 40422072372 |
10 | 14130001001 |
11 | 5aa1020986 |
12 | 28a4137ab5 |
13 | 1442527c4c |
14 | 9808773bb |
15 | 57a761e6b |
hex | 34a36b469 |
14130001001 has 2 divisors, whose sum is σ = 14130001002. Its totient is φ = 14130001000.
The previous prime is 14130000991. The next prime is 14130001007. The reversal of 14130001001 is 10010003141.
14130001001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12222408025 + 1907592976 = 110555^2 + 43676^2 .
It is a cyclic number.
It is not a de Polignac number, because 14130001001 - 210 = 14129999977 is a prime.
It is a super-2 number, since 2×141300010012 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14130001007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7065000500 + 7065000501.
It is an arithmetic number, because the mean of its divisors is an integer number (7065000501).
Almost surely, 214130001001 is an apocalyptic number.
It is an amenable number.
14130001001 is a deficient number, since it is larger than the sum of its proper divisors (1).
14130001001 is an equidigital number, since it uses as much as digits as its factorization.
14130001001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 14130001001 its reverse (10010003141), we get a palindrome (24140004142).
The spelling of 14130001001 in words is "fourteen billion, one hundred thirty million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •