Base | Representation |
---|---|
bin | 100111000010100100000… |
… | …0001111110011101000101 |
3 | 200222221121110121011112222 |
4 | 1032011020001332131011 |
5 | 1200402243343131323 |
6 | 15224533310222125 |
7 | 1062440062561226 |
oct | 116051001763505 |
9 | 20887543534488 |
10 | 5365622630213 |
11 | 178960310314a |
12 | 727a881b4945 |
13 | 2cbc8c49bb81 |
14 | 1479a9dd724d |
15 | 9488b0779c8 |
hex | 4e14807e745 |
5365622630213 has 8 divisors (see below), whose sum is σ = 5386014086400. Its totient is φ = 5345263986048.
The previous prime is 5365622630177. The next prime is 5365622630267. The reversal of 5365622630213 is 3120362265635.
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 5365622630213 - 226 = 5365555521349 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 (5365622630513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7875308 + ... + 8529461.
It is an arithmetic number, because the mean of its divisors is an integer number (673251760800).
Almost surely, 25365622630213 is an apocalyptic number.
It is an amenable number.
5365622630213 is a deficient number, since it is larger than the sum of its proper divisors (20391456187).
5365622630213 is a wasteful number, since it uses less digits than its factorization.
5365622630213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16406011.
The product of its (nonzero) digits is 1166400, while the sum is 44.
Adding to 5365622630213 its reverse (3120362265635), we get a palindrome (8485984895848).
The spelling of 5365622630213 in words is "five trillion, three hundred sixty-five billion, six hundred twenty-two million, six hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •