Base | Representation |
---|---|
bin | 11110111100001110111… |
… | …11010011100001101001 |
3 | 10202122010100202101100112 |
4 | 33132013133103201221 |
5 | 114404242243141323 |
6 | 2132221210344105 |
7 | 136544232226601 |
oct | 17360737234151 |
9 | 3678110671315 |
10 | 1063130052713 |
11 | 37a964220983 |
12 | 15206012b035 |
13 | 79339343a11 |
14 | 396548b7c01 |
15 | 1c9c3b9c178 |
hex | f7877d3869 |
1063130052713 has 4 divisors (see below), whose sum is σ = 1063680613968. Its totient is φ = 1062579491460.
The previous prime is 1063130052707. The next prime is 1063130052727. The reversal of 1063130052713 is 3172500313601.
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 1063130052713 - 24 = 1063130052697 is a prime.
It is a super-2 number, since 2×10631300527132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1063130052713.
It is not an unprimeable number, because it can be changed into a prime (1063130042713) 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, 275277731 + ... + 275281592.
It is an arithmetic number, because the mean of its divisors is an integer number (265920153492).
Almost surely, 21063130052713 is an apocalyptic number.
It is an amenable number.
1063130052713 is a deficient number, since it is larger than the sum of its proper divisors (550561255).
1063130052713 is an equidigital number, since it uses as much as digits as its factorization.
1063130052713 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 550561254.
The product of its (nonzero) digits is 11340, while the sum is 32.
The spelling of 1063130052713 in words is "one trillion, sixty-three billion, one hundred thirty million, fifty-two thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •