Base | Representation |
---|---|
bin | 11010001110001110… |
… | …00000000011011000 |
3 | 1100100010002101222000 |
4 | 31013013000003120 |
5 | 212312421410243 |
6 | 10244534401000 |
7 | 1005602224635 |
oct | 150707000330 |
9 | 40303071860 |
10 | 14077919448 |
11 | 5a7468927a |
12 | 288a800160 |
13 | 14347c1268 |
14 | 97799b18c |
15 | 575dc55d3 |
hex | 3471c00d8 |
14077919448 has 64 divisors (see below), whose sum is σ = 39600384000. Its totient is φ = 4633233696.
The previous prime is 14077919417. The next prime is 14077919459. The reversal of 14077919448 is 84491977041.
14077919448 is a `hidden beast` number, since 1 + 40 + 77 + 91 + 9 + 448 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 14077919394 and 14077919403.
It is a congruent number.
It is an unprimeable number.
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, 395440 + ... + 429567.
It is an arithmetic number, because the mean of its divisors is an integer number (618756000).
Almost surely, 214077919448 is an apocalyptic number.
14077919448 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
14077919448 is an abundant number, since it is smaller than the sum of its proper divisors (25522464552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14077919448 is a wasteful number, since it uses less digits than its factorization.
14077919448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 825101 (or 825091 counting only the distinct ones).
The product of its (nonzero) digits is 2032128, while the sum is 54.
The spelling of 14077919448 in words is "fourteen billion, seventy-seven million, nine hundred nineteen thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •