Base | Representation |
---|---|
bin | 1010011101011100… |
… | …00111101101110000 |
3 | 112111100220010020210 |
4 | 11032232013231300 |
5 | 43000103232433 |
6 | 2325123304120 |
7 | 256106331654 |
oct | 51656075560 |
9 | 15440803223 |
10 | 5615680368 |
11 | 24219a5861 |
12 | 110881b040 |
13 | 6b65876bc |
14 | 3b3b6aa64 |
15 | 22d020463 |
hex | 14eb87b70 |
5615680368 has 80 divisors (see below), whose sum is σ = 15151530240. Its totient is φ = 1788897792.
The previous prime is 5615680361. The next prime is 5615680373. The reversal of 5615680368 is 8630865165.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5615680361) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2110623 + ... + 2113281.
It is an arithmetic number, because the mean of its divisors is an integer number (189394128).
Almost surely, 25615680368 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 5615680368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7575765120).
5615680368 is an abundant number, since it is smaller than the sum of its proper divisors (9535849872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5615680368 is a wasteful number, since it uses less digits than its factorization.
5615680368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4606 (or 4600 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 48.
The square root of 5615680368 is about 74937.8433636837. The cubic root of 5615680368 is about 1777.4639185904.
The spelling of 5615680368 in words is "five billion, six hundred fifteen million, six hundred eighty thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •