Base | Representation |
---|---|
bin | 101000100100010… |
… | …1101111001100000 |
3 | 10111212102010202021 |
4 | 1101020231321200 |
5 | 10241434132043 |
6 | 343024031224 |
7 | 45506226466 |
oct | 12110557140 |
9 | 3455363667 |
10 | 1361239648 |
11 | 63942554a |
12 | 31ba62514 |
13 | 18902a262 |
14 | ccb02836 |
15 | 7e78a3ed |
hex | 5122de60 |
1361239648 has 48 divisors (see below), whose sum is σ = 2886649920. Its totient is φ = 629790336.
The previous prime is 1361239639. The next prime is 1361239661. The reversal of 1361239648 is 8469321631.
It is a Harshad number since it is a multiple of its sum of digits (43).
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 7 ways as a sum of consecutive naturals, for example, 111 + ... + 52177.
It is an arithmetic number, because the mean of its divisors is an integer number (60138540).
Almost surely, 21361239648 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 1361239648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1443324960).
1361239648 is an abundant number, since it is smaller than the sum of its proper divisors (1525410272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1361239648 is a wasteful number, since it uses less digits than its factorization.
1361239648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52139 (or 52131 counting only the distinct ones).
The product of its digits is 186624, while the sum is 43.
The square root of 1361239648 is about 36894.9813389301. The cubic root of 1361239648 is about 1108.2681778621.
The spelling of 1361239648 in words is "one billion, three hundred sixty-one million, two hundred thirty-nine thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •