Base | Representation |
---|---|
bin | 1110101110100010111… |
… | …00010101100110101101 |
3 | 1210101010202101110202022 |
4 | 13113101130111212231 |
5 | 31242314402242201 |
6 | 1024244212435525 |
7 | 51362525605454 |
oct | 7272134254655 |
9 | 1711122343668 |
10 | 506025040301 |
11 | 185670a41450 |
12 | 820a2918ba5 |
13 | 38944473191 |
14 | 1a6c54adb9b |
15 | d269a6541b |
hex | 75d17159ad |
506025040301 has 4 divisors (see below), whose sum is σ = 552027316704. Its totient is φ = 460022763900.
The previous prime is 506025040211. The next prime is 506025040327. The reversal of 506025040301 is 103040520605.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-506025040301 is a prime.
It is a super-2 number, since 2×5060250403012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (506025049301) 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, 23001138185 + ... + 23001138206.
It is an arithmetic number, because the mean of its divisors is an integer number (138006829176).
Almost surely, 2506025040301 is an apocalyptic number.
It is an amenable number.
506025040301 is a deficient number, since it is larger than the sum of its proper divisors (46002276403).
506025040301 is a wasteful number, since it uses less digits than its factorization.
506025040301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46002276402.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 506025040301 its reverse (103040520605), we get a palindrome (609065560906).
The spelling of 506025040301 in words is "five hundred six billion, twenty-five million, forty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •