Base | Representation |
---|---|
bin | 11011000100101000… |
… | …01001010011011001 |
3 | 1101111220221111000210 |
4 | 31202110021103121 |
5 | 214231243200131 |
6 | 10402121321333 |
7 | 1023113636241 |
oct | 154224112331 |
9 | 41456844023 |
10 | 14534350041 |
11 | 6189297342 |
12 | 2997636249 |
13 | 14a822cc33 |
14 | 9bc450b21 |
15 | 5a0ed4146 |
hex | 3625094d9 |
14534350041 has 8 divisors (see below), whose sum is σ = 19381403520. Its totient is φ = 9688431632.
The previous prime is 14534350037. The next prime is 14534350057. The reversal of 14534350041 is 14005343541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14534350041 - 22 = 14534350037 is a prime.
It is a super-2 number, since 2×145343500412 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14534349990 and 14534350008.
It is not an unprimeable number, because it can be changed into a prime (14534350001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 253425 + ... + 305438.
It is an arithmetic number, because the mean of its divisors is an integer number (2422675440).
Almost surely, 214534350041 is an apocalyptic number.
It is an amenable number.
14534350041 is a deficient number, since it is larger than the sum of its proper divisors (4847053479).
14534350041 is an equidigital number, since it uses as much as digits as its factorization.
14534350041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 567535.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 14534350041 its reverse (14005343541), we get a palindrome (28539693582).
It can be divided in two parts, 145343500 and 41, that added together give a palindrome (145343541).
The spelling of 14534350041 in words is "fourteen billion, five hundred thirty-four million, three hundred fifty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •