Base | Representation |
---|---|
bin | 11010000101000000… |
… | …00101111101001000 |
3 | 1100010201121201220111 |
4 | 31002200011331020 |
5 | 212133124024034 |
6 | 10233133404104 |
7 | 1003643142202 |
oct | 150240057510 |
9 | 40121551814 |
10 | 14000611144 |
11 | 5a34a86413 |
12 | 2868939634 |
13 | 14217940c0 |
14 | 96b5d5772 |
15 | 56e204364 |
hex | 342805f48 |
14000611144 has 64 divisors (see below), whose sum is σ = 28961634240. Its totient is φ = 6304193280.
The previous prime is 14000611133. The next prime is 14000611147. The reversal of 14000611144 is 44111600041.
It is a super-2 number, since 2×140006111442 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14000611147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6174699 + ... + 6176965.
It is an arithmetic number, because the mean of its divisors is an integer number (452525535).
Almost surely, 214000611144 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 14000611144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14480817120).
14000611144 is an abundant number, since it is smaller than the sum of its proper divisors (14961023096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14000611144 is a wasteful number, since it uses less digits than its factorization.
14000611144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3710 (or 3706 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 22.
The spelling of 14000611144 in words is "fourteen billion, six hundred eleven thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •