Base | Representation |
---|---|
bin | 11010011100110001… |
… | …10101010011100011 |
3 | 1100122121212111100212 |
4 | 31032120311103203 |
5 | 213040202101111 |
6 | 10305020004335 |
7 | 1011614205404 |
oct | 151630652343 |
9 | 40577774325 |
10 | 14200034531 |
11 | 6027605131 |
12 | 29036906ab |
13 | 1453ba8ac7 |
14 | 989ca79ab |
15 | 58199798b |
hex | 34e6354e3 |
14200034531 has 4 divisors (see below), whose sum is σ = 14200554000. Its totient is φ = 14199515064.
The previous prime is 14200034489. The next prime is 14200034551. The reversal of 14200034531 is 13543000241.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13543000241 = 17 ⋅796647073.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14200034531 is a prime.
It is a super-2 number, since 2×142000345312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14200034497 and 14200034506.
It is not an unprimeable number, because it can be changed into a prime (14200034551) 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, 216311 + ... + 274208.
It is an arithmetic number, because the mean of its divisors is an integer number (3550138500).
Almost surely, 214200034531 is an apocalyptic number.
14200034531 is a deficient number, since it is larger than the sum of its proper divisors (519469).
14200034531 is an equidigital number, since it uses as much as digits as its factorization.
14200034531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 519468.
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 14200034531 its reverse (13543000241), we get a palindrome (27743034772).
The spelling of 14200034531 in words is "fourteen billion, two hundred million, thirty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •