Base | Representation |
---|---|
bin | 11010001001010010… |
… | …11011001000111100 |
3 | 1100020020100202022100 |
4 | 31010221123020330 |
5 | 212221333033034 |
6 | 10240501145100 |
7 | 1004561142006 |
oct | 150451331074 |
9 | 40206322270 |
10 | 14036611644 |
11 | 5a533350a0 |
12 | 28789bb190 |
13 | 142908a383 |
14 | 9722c7376 |
15 | 572466099 |
hex | 344a5b23c |
14036611644 has 144 divisors (see below), whose sum is σ = 40092788736. Its totient is φ = 4102185600.
The previous prime is 14036611579. The next prime is 14036611651. The reversal of 14036611644 is 44611663041.
14036611644 is a `hidden beast` number, since 1 + 4 + 0 + 3 + 6 + 6 + 1 + 1 + 644 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 14036611599 and 14036611608.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3889689 + ... + 3893295.
It is an arithmetic number, because the mean of its divisors is an integer number (278422144).
Almost surely, 214036611644 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 14036611644, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20046394368).
14036611644 is an abundant number, since it is smaller than the sum of its proper divisors (26056177092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14036611644 is a wasteful number, since it uses less digits than its factorization.
14036611644 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3976 (or 3971 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 36.
The spelling of 14036611644 in words is "fourteen billion, thirty-six million, six hundred eleven thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •