Base | Representation |
---|---|
bin | 1010000001100110… |
… | …10001101010111001 |
3 | 111220002110120222001 |
4 | 11000303101222321 |
5 | 42010312311331 |
6 | 2250022101001 |
7 | 250242345604 |
oct | 50063215271 |
9 | 14802416861 |
10 | 5382150841 |
11 | 23120a1651 |
12 | 106257a761 |
13 | 67a090a52 |
14 | 390b3b33b |
15 | 217791561 |
hex | 140cd1ab9 |
5382150841 has 8 divisors (see below), whose sum is σ = 5476099904. Its totient is φ = 5288386320.
The previous prime is 5382150799. The next prime is 5382150847. The reversal of 5382150841 is 1480512835.
5382150841 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5382150841 - 27 = 5382150713 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5382150841.
It is not an unprimeable number, because it can be changed into a prime (5382150847) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13366 + ... + 104608.
It is an arithmetic number, because the mean of its divisors is an integer number (684512488).
Almost surely, 25382150841 is an apocalyptic number.
It is an amenable number.
5382150841 is a deficient number, since it is larger than the sum of its proper divisors (93949063).
5382150841 is an equidigital number, since it uses as much as digits as its factorization.
5382150841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92271.
The product of its (nonzero) digits is 38400, while the sum is 37.
The square root of 5382150841 is about 73363.1436144881. The cubic root of 5382150841 is about 1752.4754996802.
The spelling of 5382150841 in words is "five billion, three hundred eighty-two million, one hundred fifty thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •