Base | Representation |
---|---|
bin | 10011100110111101… |
… | …00000010111110001 |
3 | 1000011122222211022012 |
4 | 21303132200113301 |
5 | 133024442430340 |
6 | 4500340452305 |
7 | 521606445545 |
oct | 116336402761 |
9 | 30148884265 |
10 | 10527311345 |
11 | 4512435911 |
12 | 20596aa095 |
13 | cba015815 |
14 | 71c1c7a25 |
15 | 41931d565 |
hex | 2737a05f1 |
10527311345 has 4 divisors (see below), whose sum is σ = 12632773620. Its totient is φ = 8421849072.
The previous prime is 10527311303. The next prime is 10527311363. The reversal of 10527311345 is 54311372501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 54311372501 = 683 ⋅79518847.
It can be written as a sum of positive squares in 2 ways, for example, as 4616930704 + 5910380641 = 67948^2 + 76879^2 .
It is a cyclic number.
It is not a de Polignac number, because 10527311345 - 214 = 10527294961 is a prime.
It is a super-2 number, since 2×105273113452 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1052731130 + ... + 1052731139.
It is an arithmetic number, because the mean of its divisors is an integer number (3158193405).
Almost surely, 210527311345 is an apocalyptic number.
It is an amenable number.
10527311345 is a deficient number, since it is larger than the sum of its proper divisors (2105462275).
10527311345 is an equidigital number, since it uses as much as digits as its factorization.
10527311345 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2105462274.
The product of its (nonzero) digits is 12600, while the sum is 32.
Adding to 10527311345 its reverse (54311372501), we get a palindrome (64838683846).
The spelling of 10527311345 in words is "ten billion, five hundred twenty-seven million, three hundred eleven thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •