Base | Representation |
---|---|
bin | 101000101001001… |
… | …0101001110110000 |
3 | 10112001011012002102 |
4 | 1101102111032300 |
5 | 10243110310143 |
6 | 343154035532 |
7 | 45536524550 |
oct | 12122251660 |
9 | 3461135072 |
10 | 1363760048 |
11 | 63a897122 |
12 | 320878ba8 |
13 | 189700511 |
14 | cd19b160 |
15 | 7ead70b8 |
hex | 514953b0 |
1363760048 has 80 divisors (see below), whose sum is σ = 3085516800. Its totient is φ = 571872000.
The previous prime is 1363760039. The next prime is 1363760053. The reversal of 1363760048 is 8400673631.
It is a junction number, because it is equal to n+sod(n) for n = 1363759993 and 1363760020.
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, 1184273 + ... + 1185423.
It is an arithmetic number, because the mean of its divisors is an integer number (38568960).
Almost surely, 21363760048 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 1363760048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1542758400).
1363760048 is an abundant number, since it is smaller than the sum of its proper divisors (1721756752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1363760048 is a wasteful number, since it uses less digits than its factorization.
1363760048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1386 (or 1380 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 38.
The square root of 1363760048 is about 36929.1219500275. The cubic root of 1363760048 is about 1108.9517599014.
The spelling of 1363760048 in words is "one billion, three hundred sixty-three million, seven hundred sixty thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •