Base | Representation |
---|---|
bin | 11010111111011010… |
… | …00101110010111111 |
3 | 1101101212112121010200 |
4 | 31133231011302333 |
5 | 214134040321011 |
6 | 10353514534543 |
7 | 1022042464464 |
oct | 153755056277 |
9 | 41355477120 |
10 | 14490557631 |
11 | 61665a6470 |
12 | 2984a37453 |
13 | 149c139174 |
14 | 9b66d166b |
15 | 59c233856 |
hex | 35fb45cbf |
14490557631 has 48 divisors (see below), whose sum is σ = 24517479168. Its totient is φ = 8149075200.
The previous prime is 14490557581. The next prime is 14490557647. The reversal of 14490557631 is 13675509441.
14490557631 is a `hidden beast` number, since 1 + 4 + 4 + 9 + 0 + 5 + 5 + 7 + 631 = 666.
It is not a de Polignac number, because 14490557631 - 219 = 14490033343 is a prime.
It is a super-2 number, since 2×144905576312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14490557671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 58860 + ... + 180126.
It is an arithmetic number, because the mean of its divisors is an integer number (510780816).
Almost surely, 214490557631 is an apocalyptic number.
14490557631 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
14490557631 is a deficient number, since it is larger than the sum of its proper divisors (10026921537).
14490557631 is a wasteful number, since it uses less digits than its factorization.
14490557631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121372 (or 121369 counting only the distinct ones).
The product of its (nonzero) digits is 453600, while the sum is 45.
The spelling of 14490557631 in words is "fourteen billion, four hundred ninety million, five hundred fifty-seven thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •