Base | Representation |
---|---|
bin | 110011010010… |
… | …001010111000 |
3 | 221022000101100 |
4 | 303102022320 |
5 | 11420200033 |
6 | 1200051400 |
7 | 222161442 |
oct | 63221270 |
9 | 27260340 |
10 | 13443768 |
11 | 7652558 |
12 | 4603b60 |
13 | 2a291c0 |
14 | 1add492 |
15 | 12a8513 |
hex | cd22b8 |
13443768 has 96 divisors (see below), whose sum is σ = 40098240. Its totient is φ = 4043520.
The previous prime is 13443743. The next prime is 13443797. The reversal of 13443768 is 86734431.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 49473 + ... + 49743.
It is an arithmetic number, because the mean of its divisors is an integer number (417690).
Almost surely, 213443768 is an apocalyptic number.
13443768 is a gapful number since it is divisible by the number (18) 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 13443768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20049120).
13443768 is an abundant number, since it is smaller than the sum of its proper divisors (26654472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13443768 is a wasteful number, since it uses less digits than its factorization.
13443768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349 (or 342 counting only the distinct ones).
The product of its digits is 48384, while the sum is 36.
The square root of 13443768 is about 3666.5744230821. The cubic root of 13443768 is about 237.7790949808.
The spelling of 13443768 in words is "thirteen million, four hundred forty-three thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •