Base | Representation |
---|---|
bin | 101000101101000… |
… | …0101101010000000 |
3 | 10112011222111100001 |
4 | 1101122011222000 |
5 | 10244120342113 |
6 | 343305405344 |
7 | 45563023660 |
oct | 12132055200 |
9 | 3464874301 |
10 | 1365793408 |
11 | 640a55891 |
12 | 321499854 |
13 | 189c62ba5 |
14 | cd56a1a0 |
15 | 7ed897dd |
hex | 51685a80 |
1365793408 has 64 divisors (see below), whose sum is σ = 3122521920. Its totient is φ = 582912000.
The previous prime is 1365793343. The next prime is 1365793489. The reversal of 1365793408 is 8043975631.
It is a tau number, because it is divible by the number of its divisors (64).
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 7 ways as a sum of consecutive naturals, for example, 221860 + ... + 227932.
It is an arithmetic number, because the mean of its divisors is an integer number (48789405).
Almost surely, 21365793408 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1365793408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1561260960).
1365793408 is an abundant number, since it is smaller than the sum of its proper divisors (1756728512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1365793408 is an equidigital number, since it uses as much as digits as its factorization.
1365793408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6345 (or 6333 counting only the distinct ones).
The product of its (nonzero) digits is 544320, while the sum is 46.
The square root of 1365793408 is about 36956.6422717216. The cubic root of 1365793408 is about 1109.5026335443.
The spelling of 1365793408 in words is "one billion, three hundred sixty-five million, seven hundred ninety-three thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •