Base | Representation |
---|---|
bin | 11011010011010000… |
… | …10101000101110000 |
3 | 1101211110212220020020 |
4 | 31221220111011300 |
5 | 220004203103322 |
6 | 10422224043440 |
7 | 1026134065440 |
oct | 155150250560 |
9 | 41743786206 |
10 | 14657081712 |
11 | 62415a4479 |
12 | 2a10763580 |
13 | 14c77a2320 |
14 | 9d087c120 |
15 | 5abb7905c |
hex | 369a15170 |
14657081712 has 160 divisors (see below), whose sum is σ = 46862000640. Its totient is φ = 3844039680.
The previous prime is 14657081689. The next prime is 14657081717. The reversal of 14657081712 is 21718075641.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14657081717) 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, 781339 + ... + 799877.
It is an arithmetic number, because the mean of its divisors is an integer number (292887504).
Almost surely, 214657081712 is an apocalyptic number.
14657081712 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 14657081712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23431000320).
14657081712 is an abundant number, since it is smaller than the sum of its proper divisors (32204918928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14657081712 is a wasteful number, since it uses less digits than its factorization.
14657081712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18751 (or 18745 counting only the distinct ones).
The product of its (nonzero) digits is 94080, while the sum is 42.
The spelling of 14657081712 in words is "fourteen billion, six hundred fifty-seven million, eighty-one thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •