Base | Representation |
---|---|
bin | 11010001100111110… |
… | …10110011101000100 |
3 | 1100022101112100001220 |
4 | 31012133112131010 |
5 | 212302241303234 |
6 | 10243523520340 |
7 | 1005414664500 |
oct | 150637263504 |
9 | 40271470056 |
10 | 14067525444 |
11 | 5a6982a095 |
12 | 28872290b0 |
13 | 14325c226b |
14 | 976453300 |
15 | 575020a49 |
hex | 3467d6744 |
14067525444 has 288 divisors, whose sum is σ = 41723781120. Its totient is φ = 3665668608.
The previous prime is 14067525427. The next prime is 14067525547. The reversal of 14067525444 is 44452576041.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 14067525396 and 14067525405.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 38330949 + ... + 38331315.
It is an arithmetic number, because the mean of its divisors is an integer number (144874240).
Almost surely, 214067525444 is an apocalyptic number.
14067525444 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14067525444, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20861890560).
14067525444 is an abundant number, since it is smaller than the sum of its proper divisors (27656255676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14067525444 is a wasteful number, since it uses less digits than its factorization.
14067525444 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 527 (or 518 counting only the distinct ones).
The product of its (nonzero) digits is 537600, while the sum is 42.
The spelling of 14067525444 in words is "fourteen billion, sixty-seven million, five hundred twenty-five thousand, four hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •