Base | Representation |
---|---|
bin | 11010000110001000… |
… | …10011101001101111 |
3 | 1100011101111001020201 |
4 | 31003010103221233 |
5 | 212143041320211 |
6 | 10234113054331 |
7 | 1004116631341 |
oct | 150304235157 |
9 | 40141431221 |
10 | 14010104431 |
11 | 5a3a37a904 |
12 | 286bb573a7 |
13 | 142373912b |
14 | 96c987291 |
15 | 56ee7c0c1 |
hex | 343113a6f |
14010104431 has 2 divisors, whose sum is σ = 14010104432. Its totient is φ = 14010104430.
The previous prime is 14010104419. The next prime is 14010104453. The reversal of 14010104431 is 13440101041.
14010104431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14010104431 - 225 = 13976549999 is a prime.
It is a super-2 number, since 2×140101044312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14010104399 and 14010104408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14010104411) 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, 7005052215 + 7005052216.
It is an arithmetic number, because the mean of its divisors is an integer number (7005052216).
Almost surely, 214010104431 is an apocalyptic number.
14010104431 is a deficient number, since it is larger than the sum of its proper divisors (1).
14010104431 is an equidigital number, since it uses as much as digits as its factorization.
14010104431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 14010104431 its reverse (13440101041), we get a palindrome (27450205472).
The spelling of 14010104431 in words is "fourteen billion, ten million, one hundred four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •