Base | Representation |
---|---|
bin | 1110111101101000011… |
… | …11100111100100101001 |
3 | 1211011001021002012121111 |
4 | 13132310033213210221 |
5 | 31410412011220403 |
6 | 1032104045110321 |
7 | 52100333154013 |
oct | 7366417474451 |
9 | 1734037065544 |
10 | 514125101353 |
11 | 189048242186 |
12 | 837835583a1 |
13 | 3963564b806 |
14 | 1ac531831b3 |
15 | d590c2856d |
hex | 77b43e7929 |
514125101353 has 4 divisors (see below), whose sum is σ = 514126638208. Its totient is φ = 514123564500.
The previous prime is 514125101339. The next prime is 514125101363. The reversal of 514125101353 is 353101521415.
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 not a de Polignac number, because 514125101353 - 213 = 514125093161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (514125101363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30273 + ... + 1014478.
It is an arithmetic number, because the mean of its divisors is an integer number (128531659552).
Almost surely, 2514125101353 is an apocalyptic number.
It is an amenable number.
514125101353 is a deficient number, since it is larger than the sum of its proper divisors (1536855).
514125101353 is a wasteful number, since it uses less digits than its factorization.
514125101353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1536854.
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 514125101353 its reverse (353101521415), we get a palindrome (867226622768).
The spelling of 514125101353 in words is "five hundred fourteen billion, one hundred twenty-five million, one hundred one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •