Base | Representation |
---|---|
bin | 100001101001100001… |
… | …110010101111000101 |
3 | 10110020222100120012102 |
4 | 201221201302233011 |
5 | 1042443313021423 |
6 | 24333055401445 |
7 | 2416224446336 |
oct | 415141625705 |
9 | 113228316172 |
10 | 36130204613 |
11 | 14360616538 |
12 | 7003b23285 |
13 | 353a41b7c9 |
14 | 1a6a66c28d |
15 | e16dd0c28 |
hex | 869872bc5 |
36130204613 has 4 divisors (see below), whose sum is σ = 36190322028. Its totient is φ = 36070087200.
The previous prime is 36130204559. The next prime is 36130204637. The reversal of 36130204613 is 31640203163.
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 10999394884 + 25130809729 = 104878^2 + 158527^2 .
It is a cyclic number.
It is not a de Polignac number, because 36130204613 - 216 = 36130139077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (36130204013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30057806 + ... + 30059007.
It is an arithmetic number, because the mean of its divisors is an integer number (9047580507).
Almost surely, 236130204613 is an apocalyptic number.
It is an amenable number.
36130204613 is a deficient number, since it is larger than the sum of its proper divisors (60117415).
36130204613 is an equidigital number, since it uses as much as digits as its factorization.
36130204613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60117414.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 36130204613 its reverse (31640203163), we get a palindrome (67770407776).
The spelling of 36130204613 in words is "thirty-six billion, one hundred thirty million, two hundred four thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •