Base | Representation |
---|---|
bin | 11011010111010000… |
… | …11100010110000000 |
3 | 1101220211002011000102 |
4 | 31223220130112000 |
5 | 220041302301411 |
6 | 10425423541532 |
7 | 1030022412416 |
oct | 155350342600 |
9 | 41824064012 |
10 | 14690665856 |
11 | 6259552769 |
12 | 2a1ba5a8a8 |
13 | 15017307b9 |
14 | 9d51012b6 |
15 | 5aeaaed3b |
hex | 36ba1c580 |
14690665856 has 64 divisors (see below), whose sum is σ = 30004793280. Its totient is φ = 7160713728.
The previous prime is 14690665793. The next prime is 14690665867. The reversal of 14690665856 is 65856609641.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3228575 + ... + 3233121.
It is an arithmetic number, because the mean of its divisors is an integer number (468824895).
Almost surely, 214690665856 is an apocalyptic number.
14690665856 is a gapful number since it is divisible by the number (16) 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 14690665856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15002396640).
14690665856 is an abundant number, since it is smaller than the sum of its proper divisors (15314127424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14690665856 is an equidigital number, since it uses as much as digits as its factorization.
14690665856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5191 (or 5179 counting only the distinct ones).
The product of its (nonzero) digits is 9331200, while the sum is 56.
The spelling of 14690665856 in words is "fourteen billion, six hundred ninety million, six hundred sixty-five thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •