Base | Representation |
---|---|
bin | 1010100101010000… |
… | …11101100000101100 |
3 | 112122221101020012120 |
4 | 11102220131200230 |
5 | 43113403240034 |
6 | 2335430032540 |
7 | 260534205210 |
oct | 52250354054 |
9 | 15587336176 |
10 | 5681305644 |
11 | 2455a49023 |
12 | 11267a8750 |
13 | 6c7053c21 |
14 | 3bc770940 |
15 | 233b84c49 |
hex | 152a1d82c |
5681305644 has 96 divisors (see below), whose sum is σ = 15904358400. Its totient is φ = 1544201280.
The previous prime is 5681305607. The next prime is 5681305657. The reversal of 5681305644 is 4465031865.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 5681305596 and 5681305605.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 135147 + ... + 172125.
It is an arithmetic number, because the mean of its divisors is an integer number (165670400).
Almost surely, 25681305644 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 5681305644, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7952179200).
5681305644 is an abundant number, since it is smaller than the sum of its proper divisors (10223052756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5681305644 is a wasteful number, since it uses less digits than its factorization.
5681305644 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37083 (or 37081 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 42.
The square root of 5681305644 is about 75374.4362764989. The cubic root of 5681305644 is about 1784.3609817864.
The spelling of 5681305644 in words is "five billion, six hundred eighty-one million, three hundred five thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •