Base | Representation |
---|---|
bin | 11011000110100010… |
… | …00110111101011110 |
3 | 1101120001000102002200 |
4 | 31203101012331132 |
5 | 214244341044410 |
6 | 10403452032330 |
7 | 1023366526521 |
oct | 154321067536 |
9 | 41501012080 |
10 | 14550331230 |
11 | 6197312236 |
12 | 29a0a626a6 |
13 | 14ab637066 |
14 | 9c0610bb8 |
15 | 5a25de3c0 |
hex | 363446f5e |
14550331230 has 24 divisors (see below), whose sum is σ = 37830861432. Its totient is φ = 3880088304.
The previous prime is 14550331219. The next prime is 14550331259. The reversal of 14550331230 is 3213305541.
14550331230 is a `hidden beast` number, since 145 + 503 + 3 + 12 + 3 + 0 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 14550331194 and 14550331203.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 80835084 + ... + 80835263.
It is an arithmetic number, because the mean of its divisors is an integer number (1576285893).
Almost surely, 214550331230 is an apocalyptic number.
14550331230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14550331230 is an abundant number, since it is smaller than the sum of its proper divisors (23280530202).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14550331230 is a wasteful number, since it uses less digits than its factorization.
14550331230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161670360 (or 161670357 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
Adding to 14550331230 its reverse (3213305541), we get a palindrome (17763636771).
The spelling of 14550331230 in words is "fourteen billion, five hundred fifty million, three hundred thirty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •