Base | Representation |
---|---|
bin | 11010010000111001… |
… | …10111111001000001 |
3 | 1100101200110002012000 |
4 | 31020130313321001 |
5 | 212334202233101 |
6 | 10251101054213 |
7 | 1006264452351 |
oct | 151034677101 |
9 | 40350402160 |
10 | 14100430401 |
11 | 5a86364072 |
12 | 2896257369 |
13 | 1439373555 |
14 | 97a97ab61 |
15 | 577d70486 |
hex | 348737e41 |
14100430401 has 16 divisors (see below), whose sum is σ = 20955436800. Its totient is φ = 9370627344.
The previous prime is 14100430387. The next prime is 14100430453. The reversal of 14100430401 is 10403400141.
14100430401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14100430401 - 25 = 14100430369 is a prime.
It is not an unprimeable number, because it can be changed into a prime (14100430801) 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 in 15 ways as a sum of consecutive naturals, for example, 815161 + ... + 832278.
It is an arithmetic number, because the mean of its divisors is an integer number (1309714800).
Almost surely, 214100430401 is an apocalyptic number.
It is an amenable number.
14100430401 is a deficient number, since it is larger than the sum of its proper divisors (6855006399).
14100430401 is a wasteful number, since it uses less digits than its factorization.
14100430401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1647765 (or 1647759 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 14100430401 its reverse (10403400141), we get a palindrome (24503830542).
It can be divided in two parts, 141004 and 30401, that added together give a triangular number (171405 = T585).
The spelling of 14100430401 in words is "fourteen billion, one hundred million, four hundred thirty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •