Base | Representation |
---|---|
bin | 100111001010010111100… |
… | …1100011010010101000101 |
3 | 201001112212201110122211002 |
4 | 1032110233030122111011 |
5 | 1201141111231221423 |
6 | 15240344531223045 |
7 | 1063602352320626 |
oct | 116245714322505 |
9 | 21045781418732 |
10 | 5382385804613 |
11 | 1795725517194 |
12 | 72b186147a85 |
13 | 3007313b328c |
14 | 14871a469a4d |
15 | 9501ca6e228 |
hex | 4e52f31a545 |
5382385804613 has 4 divisors (see below), whose sum is σ = 5391341522028. Its totient is φ = 5373430087200.
The previous prime is 5382385804603. The next prime is 5382385804639. The reversal of 5382385804613 is 3164085832835.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3331581368644 + 2050804435969 = 1825262^2 + 1432063^2 .
It is a cyclic number.
It is not a de Polignac number, because 5382385804613 - 216 = 5382385739077 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5382385804603) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4477857806 + ... + 4477859007.
It is an arithmetic number, because the mean of its divisors is an integer number (1347835380507).
Almost surely, 25382385804613 is an apocalyptic number.
It is an amenable number.
5382385804613 is a deficient number, since it is larger than the sum of its proper divisors (8955717415).
5382385804613 is an equidigital number, since it uses as much as digits as its factorization.
5382385804613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8955717414.
The product of its (nonzero) digits is 16588800, while the sum is 56.
The spelling of 5382385804613 in words is "five trillion, three hundred eighty-two billion, three hundred eighty-five million, eight hundred four thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •