Base | Representation |
---|---|
bin | 11010001010111011… |
… | …01010001000010011 |
3 | 1100021012010102102022 |
4 | 31011131222020103 |
5 | 212233334221111 |
6 | 10242110442055 |
7 | 1005115421654 |
oct | 150535521023 |
9 | 40235112368 |
10 | 14050304531 |
11 | 5a6003782a |
12 | 288150332b |
13 | 142bb72a83 |
14 | 97404d52b |
15 | 57376d2db |
hex | 34576a213 |
14050304531 has 4 divisors (see below), whose sum is σ = 14116893864. Its totient is φ = 13983715200.
The previous prime is 14050304501. The next prime is 14050304563. The reversal of 14050304531 is 13540305041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13540305041 = 12101 ⋅1118941.
It is a cyclic number.
It is not a de Polignac number, because 14050304531 - 26 = 14050304467 is a prime.
It is a super-2 number, since 2×140503045312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14050304531.
It is not an unprimeable number, because it can be changed into a prime (14050304501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33294350 + ... + 33294771.
It is an arithmetic number, because the mean of its divisors is an integer number (3529223466).
Almost surely, 214050304531 is an apocalyptic number.
14050304531 is a deficient number, since it is larger than the sum of its proper divisors (66589333).
14050304531 is an equidigital number, since it uses as much as digits as its factorization.
14050304531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66589332.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 14050304531 its reverse (13540305041), we get a palindrome (27590609572).
The spelling of 14050304531 in words is "fourteen billion, fifty million, three hundred four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •