Base | Representation |
---|---|
bin | 11011010100001101… |
… | …10010000011011000 |
3 | 1101212000220110210010 |
4 | 31222012302003120 |
5 | 220013224032124 |
6 | 10423111121520 |
7 | 1026261664365 |
oct | 155206620330 |
9 | 41760813703 |
10 | 14665064664 |
11 | 6246057158 |
12 | 2a133732a0 |
13 | 14c9338a73 |
14 | 9d195946c |
15 | 5ac704529 |
hex | 36a1b20d8 |
14665064664 has 64 divisors (see below), whose sum is σ = 37580618880. Its totient is φ = 4766112000.
The previous prime is 14665064657. The next prime is 14665064677. The reversal of 14665064664 is 46646056641.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1975119 + ... + 1982529.
It is an arithmetic number, because the mean of its divisors is an integer number (587197170).
Almost surely, 214665064664 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14665064664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18790309440).
14665064664 is an abundant number, since it is smaller than the sum of its proper divisors (22915554216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14665064664 is a wasteful number, since it uses less digits than its factorization.
14665064664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9472 (or 9468 counting only the distinct ones).
The product of its (nonzero) digits is 2488320, while the sum is 48.
The spelling of 14665064664 in words is "fourteen billion, six hundred sixty-five million, sixty-four thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •