Base | Representation |
---|---|
bin | 11011000010111100… |
… | …10101010011101011 |
3 | 1101110221101210101220 |
4 | 31201132111103223 |
5 | 214214140242220 |
6 | 10400455113123 |
7 | 1022553014145 |
oct | 154136252353 |
9 | 41427353356 |
10 | 14520243435 |
11 | 6181331895 |
12 | 29929727a3 |
13 | 14a5331129 |
14 | 9ba61bc95 |
15 | 59eb49540 |
hex | 3617954eb |
14520243435 has 8 divisors (see below), whose sum is σ = 23232389520. Its totient is φ = 7744129824.
The previous prime is 14520243433. The next prime is 14520243449. The reversal of 14520243435 is 53434202541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14520243435 - 21 = 14520243433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14520243396 and 14520243405.
It is not an unprimeable number, because it can be changed into a prime (14520243431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 484008100 + ... + 484008129.
It is an arithmetic number, because the mean of its divisors is an integer number (2904048690).
Almost surely, 214520243435 is an apocalyptic number.
14520243435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
14520243435 is a deficient number, since it is larger than the sum of its proper divisors (8712146085).
14520243435 is an equidigital number, since it uses as much as digits as its factorization.
14520243435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 968016237.
The product of its (nonzero) digits is 57600, while the sum is 33.
Adding to 14520243435 its reverse (53434202541), we get a palindrome (67954445976).
The spelling of 14520243435 in words is "fourteen billion, five hundred twenty million, two hundred forty-three thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •