Base | Representation |
---|---|
bin | 11011000011001010… |
… | …11110101000010110 |
3 | 1101111001220221221111 |
4 | 31201211132220112 |
5 | 214220130213010 |
6 | 10401003205234 |
7 | 1022604645310 |
oct | 154145365026 |
9 | 41431827844 |
10 | 14522116630 |
11 | 61823a118a |
12 | 299351681a |
13 | 14a5838928 |
14 | 9ba9887b0 |
15 | 59edb958a |
hex | 36195ea16 |
14522116630 has 64 divisors (see below), whose sum is σ = 30585600000. Its totient is φ = 4861565568.
The previous prime is 14522116573. The next prime is 14522116639. The reversal of 14522116630 is 3661122541.
It is a happy number.
14522116630 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 14522116592 and 14522116601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14522116639) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 603571 + ... + 627169.
It is an arithmetic number, because the mean of its divisors is an integer number (477900000).
Almost surely, 214522116630 is an apocalyptic number.
14522116630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14522116630 is an abundant number, since it is smaller than the sum of its proper divisors (16063483370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14522116630 is a wasteful number, since it uses less digits than its factorization.
14522116630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23821.
The product of its (nonzero) digits is 8640, while the sum is 31.
The spelling of 14522116630 in words is "fourteen billion, five hundred twenty-two million, one hundred sixteen thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •