Base | Representation |
---|---|
bin | 11010001010111100… |
… | …10000000101111110 |
3 | 1100021012102022201112 |
4 | 31011132100011332 |
5 | 212233404210110 |
6 | 10242114042022 |
7 | 1005116640215 |
oct | 150536200576 |
9 | 40235368645 |
10 | 14050460030 |
11 | 5a60133642 |
12 | 2881579312 |
13 | 142bbc8799 |
14 | 97409007c |
15 | 57379e405 |
hex | 34579017e |
14050460030 has 8 divisors (see below), whose sum is σ = 25290828072. Its totient is φ = 5620184008.
The previous prime is 14050460029. The next prime is 14050460051. The reversal of 14050460030 is 3006405041.
It is a happy number.
14050460030 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 junction number, because it is equal to n+sod(n) for n = 14050459978 and 14050460005.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 702522992 + ... + 702523011.
It is an arithmetic number, because the mean of its divisors is an integer number (3161353509).
Almost surely, 214050460030 is an apocalyptic number.
14050460030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14050460030 is a deficient number, since it is larger than the sum of its proper divisors (11240368042).
14050460030 is a wasteful number, since it uses less digits than its factorization.
14050460030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1405046010.
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 14050460030 its reverse (3006405041), we get a palindrome (17056865071).
The spelling of 14050460030 in words is "fourteen billion, fifty million, four hundred sixty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •