Base | Representation |
---|---|
bin | 11010001000000011… |
… | …00110011011010000 |
3 | 1100012111201100222000 |
4 | 31010001212123100 |
5 | 212211200001422 |
6 | 10235445314000 |
7 | 1004403332031 |
oct | 150401463320 |
9 | 40174640860 |
10 | 14026172112 |
11 | 5a48454787 |
12 | 2875405900 |
13 | 1426b73734 |
14 | 970b6aa88 |
15 | 5715a2cac |
hex | 3440666d0 |
14026172112 has 80 divisors (see below), whose sum is σ = 40811911680. Its totient is φ = 4611333888.
The previous prime is 14026172089. The next prime is 14026172113. The reversal of 14026172112 is 21127162041.
14026172112 is a `hidden beast` number, since 1 + 40 + 2 + 617 + 2 + 1 + 1 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14026172113) 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, 190848 + ... + 253919.
It is an arithmetic number, because the mean of its divisors is an integer number (510148896).
Almost surely, 214026172112 is an apocalyptic number.
14026172112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14026172112 is an abundant number, since it is smaller than the sum of its proper divisors (26785739568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14026172112 is a wasteful number, since it uses less digits than its factorization.
14026172112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 444857 (or 444845 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 27.
The spelling of 14026172112 in words is "fourteen billion, twenty-six million, one hundred seventy-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •