Base | Representation |
---|---|
bin | 11011000010111110… |
… | …00110100100011010 |
3 | 1101110221210001012001 |
4 | 31201133012210122 |
5 | 214214213221320 |
6 | 10400503311214 |
7 | 1022554514335 |
oct | 154137064432 |
9 | 41427701161 |
10 | 14520445210 |
11 | 618145a447 |
12 | 2992a4b50a |
13 | 14a53a1c1b |
14 | 9ba67161c |
15 | 59eb8920a |
hex | 3617c691a |
14520445210 has 32 divisors (see below), whose sum is σ = 26270879184. Its totient is φ = 5778432000.
The previous prime is 14520445193. The next prime is 14520445217. The reversal of 14520445210 is 1254402541.
14520445210 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 10504815049 + 4015630161 = 102493^2 + 63369^2 .
It is a super-2 number, since 2×145204452102 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14520445217) 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 15 ways as a sum of consecutive naturals, for example, 3181330 + ... + 3185890.
Almost surely, 214520445210 is an apocalyptic number.
14520445210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14520445210 is a deficient number, since it is larger than the sum of its proper divisors (11750433974).
14520445210 is a wasteful number, since it uses less digits than its factorization.
14520445210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6130.
The product of its (nonzero) digits is 6400, while the sum is 28.
Adding to 14520445210 its reverse (1254402541), we get a palindrome (15774847751).
The spelling of 14520445210 in words is "fourteen billion, five hundred twenty million, four hundred forty-five thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •