Base | Representation |
---|---|
bin | 11011000100010001… |
… | …10111011010100000 |
3 | 1101111201101020222120 |
4 | 31202020313122200 |
5 | 214230014040214 |
6 | 10401534104240 |
7 | 1023046542540 |
oct | 154210673240 |
9 | 41451336876 |
10 | 14531393184 |
11 | 6187657860 |
12 | 299664b080 |
13 | 14a7736109 |
14 | 9bbcc1320 |
15 | 5a0aecea9 |
hex | 3622376a0 |
14531393184 has 192 divisors, whose sum is σ = 48718236672. Its totient is φ = 3682252800.
The previous prime is 14531393111. The next prime is 14531393197. The reversal of 14531393184 is 48139313541.
It is a super-2 number, since 2×145313931842 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 279099 + ... + 327045.
It is an arithmetic number, because the mean of its divisors is an integer number (253740816).
Almost surely, 214531393184 is an apocalyptic number.
14531393184 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14531393184, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24359118336).
14531393184 is an abundant number, since it is smaller than the sum of its proper divisors (34186843488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14531393184 is a wasteful number, since it uses less digits than its factorization.
14531393184 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48019 (or 48011 counting only the distinct ones).
The product of its digits is 155520, while the sum is 42.
The spelling of 14531393184 in words is "fourteen billion, five hundred thirty-one million, three hundred ninety-three thousand, one hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •