Base | Representation |
---|---|
bin | 11010001010111100… |
… | …01001100111100001 |
3 | 1100021012100222100010 |
4 | 31011132021213201 |
5 | 212233402333010 |
6 | 10242113315133 |
7 | 1005116466663 |
oct | 150536114741 |
9 | 40235328303 |
10 | 14050433505 |
11 | 5a60115719 |
12 | 2881565aa9 |
13 | 142bbb96a4 |
14 | 974084533 |
15 | 573796620 |
hex | 3457899e1 |
14050433505 has 8 divisors (see below), whose sum is σ = 22480693632. Its totient is φ = 7493564528.
The previous prime is 14050433491. The next prime is 14050433549. The reversal of 14050433505 is 50533405041.
14050433505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 14050433505 - 210 = 14050432481 is a prime.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 468347769 + ... + 468347798.
It is an arithmetic number, because the mean of its divisors is an integer number (2810086704).
Almost surely, 214050433505 is an apocalyptic number.
14050433505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14050433505 is a deficient number, since it is larger than the sum of its proper divisors (8430260127).
14050433505 is an equidigital number, since it uses as much as digits as its factorization.
14050433505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 936695575.
The product of its (nonzero) digits is 18000, while the sum is 30.
Adding to 14050433505 its reverse (50533405041), we get a palindrome (64583838546).
The spelling of 14050433505 in words is "fourteen billion, fifty million, four hundred thirty-three thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.195 sec. • engine limits •