Base | Representation |
---|---|
bin | 11010000110010000… |
… | …00111010011011111 |
3 | 1100011110100202020200 |
4 | 31003020013103133 |
5 | 212143320234211 |
6 | 10234150314543 |
7 | 1004131256064 |
oct | 150310072337 |
9 | 40143322220 |
10 | 14011102431 |
11 | 5a3a9a16a7 |
12 | 2870358a53 |
13 | 14239c8471 |
14 | 96cb66c6b |
15 | 5700c7b56 |
hex | 3432074df |
14011102431 has 12 divisors (see below), whose sum is σ = 20277110880. Its totient is φ = 9322803360.
The previous prime is 14011102421. The next prime is 14011102447. The reversal of 14011102431 is 13420111041.
14011102431 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 14011102431 - 233 = 5421167839 is a prime.
It is a super-2 number, since 2×140111024312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14011102421) 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 11 ways as a sum of consecutive naturals, for example, 1489351 + ... + 1498728.
It is an arithmetic number, because the mean of its divisors is an integer number (1689759240).
Almost surely, 214011102431 is an apocalyptic number.
14011102431 is a deficient number, since it is larger than the sum of its proper divisors (6266008449).
14011102431 is a wasteful number, since it uses less digits than its factorization.
14011102431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2988606 (or 2988603 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 14011102431 its reverse (13420111041), we get a palindrome (27431213472).
The spelling of 14011102431 in words is "fourteen billion, eleven million, one hundred two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •