Base | Representation |
---|---|
bin | 1110101111010011001… |
… | …01101100001010000001 |
3 | 1210102011222122221010201 |
4 | 13113221211230022001 |
5 | 31244132104121103 |
6 | 1024352323325201 |
7 | 51405545131252 |
oct | 7275145541201 |
9 | 1712158587121 |
10 | 506430145153 |
11 | 185859683749 |
12 | 82196520801 |
13 | 389aa3811aa |
14 | 1a723202b29 |
15 | d2903d651d |
hex | 75e996c281 |
506430145153 has 8 divisors (see below), whose sum is σ = 512539522560. Its totient is φ = 500342242800.
The previous prime is 506430145141. The next prime is 506430145229. The reversal of 506430145153 is 351541034605.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-506430145153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (506430145853) 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, 5321313 + ... + 5415646.
It is an arithmetic number, because the mean of its divisors is an integer number (64067440320).
Almost surely, 2506430145153 is an apocalyptic number.
It is an amenable number.
506430145153 is a deficient number, since it is larger than the sum of its proper divisors (6109377407).
506430145153 is a wasteful number, since it uses less digits than its factorization.
506430145153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10737527.
The product of its (nonzero) digits is 108000, while the sum is 37.
Adding to 506430145153 its reverse (351541034605), we get a palindrome (857971179758).
The spelling of 506430145153 in words is "five hundred six billion, four hundred thirty million, one hundred forty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •