Base | Representation |
---|---|
bin | 1111010010110110001… |
… | …01010110110101010101 |
3 | 1212020102222120100221012 |
4 | 13221123011112311111 |
5 | 32102223110003023 |
6 | 1041230131502005 |
7 | 52652505332201 |
oct | 7513305266525 |
9 | 1766388510835 |
10 | 525514141013 |
11 | 19296203a254 |
12 | 85a21757905 |
13 | 3a72c04aa34 |
14 | 1b6139a3b01 |
15 | da0aa13978 |
hex | 7a5b156d55 |
525514141013 has 4 divisors (see below), whose sum is σ = 526900722240. Its totient is φ = 524127559788.
The previous prime is 525514140971. The next prime is 525514141037. The reversal of 525514141013 is 310141415525.
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-525514141013 is a prime.
It is a super-2 number, since 2×5255141410132 (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 (525514141093) 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, 693290045 + ... + 693290802.
It is an arithmetic number, because the mean of its divisors is an integer number (131725180560).
Almost surely, 2525514141013 is an apocalyptic number.
It is an amenable number.
525514141013 is a deficient number, since it is larger than the sum of its proper divisors (1386581227).
525514141013 is a wasteful number, since it uses less digits than its factorization.
525514141013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1386581226.
The product of its (nonzero) digits is 12000, while the sum is 32.
Adding to 525514141013 its reverse (310141415525), we get a palindrome (835655556538).
The spelling of 525514141013 in words is "five hundred twenty-five billion, five hundred fourteen million, one hundred forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •