Base | Representation |
---|---|
bin | 11010001111110010… |
… | …01101011111100000 |
3 | 1100101000212010011200 |
4 | 31013321031133200 |
5 | 212324304103241 |
6 | 10250124441200 |
7 | 1006122134556 |
oct | 150771153740 |
9 | 40330763150 |
10 | 14091081696 |
11 | 5a8105926a |
12 | 28930a9200 |
13 | 143744c283 |
14 | 979625bd6 |
15 | 5771254b6 |
hex | 347e4d7e0 |
14091081696 has 72 divisors (see below), whose sum is σ = 40086479160. Its totient is φ = 4695273216.
The previous prime is 14091081691. The next prime is 14091081743. The reversal of 14091081696 is 69618019041.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14091081691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 931086 + ... + 946098.
It is an arithmetic number, because the mean of its divisors is an integer number (556756655).
Almost surely, 214091081696 is an apocalyptic number.
14091081696 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
14091081696 is an abundant number, since it is smaller than the sum of its proper divisors (25995397464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14091081696 is a wasteful number, since it uses less digits than its factorization.
14091081696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18288 (or 18277 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 45.
The spelling of 14091081696 in words is "fourteen billion, ninety-one million, eighty-one thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •