Base | Representation |
---|---|
bin | 11010010011000100… |
… | …00101001100100000 |
3 | 1100102221120210220220 |
4 | 31021202011030200 |
5 | 212403323312312 |
6 | 10252550003040 |
7 | 1006604613630 |
oct | 151142051440 |
9 | 40387523826 |
10 | 14118572832 |
11 | 5a95625811 |
12 | 28a0346480 |
13 | 1440056310 |
14 | 97d1406c0 |
15 | 579755c8c |
hex | 349885320 |
14118572832 has 192 divisors, whose sum is σ = 45687769344. Its totient is φ = 3717550080.
The previous prime is 14118572827. The next prime is 14118572833. The reversal of 14118572832 is 23827581141.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (14118572833) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8708982 + ... + 8710602.
It is an arithmetic number, because the mean of its divisors is an integer number (237957132).
Almost surely, 214118572832 is an apocalyptic number.
14118572832 is a gapful number since it is divisible by the number (12) 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 14118572832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22843884672).
14118572832 is an abundant number, since it is smaller than the sum of its proper divisors (31569196512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14118572832 is a wasteful number, since it uses less digits than its factorization.
14118572832 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2651 (or 2643 counting only the distinct ones).
The product of its digits is 107520, while the sum is 42.
The spelling of 14118572832 in words is "fourteen billion, one hundred eighteen million, five hundred seventy-two thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •