Base | Representation |
---|---|
bin | 11111000110101110101… |
… | …01100001011010001001 |
3 | 10210011200001012201000200 |
4 | 33203113111201122021 |
5 | 120002312221221323 |
6 | 2134552251122413 |
7 | 140133661325541 |
oct | 17432725413211 |
9 | 3704601181020 |
10 | 1068764632713 |
11 | 382295855268 |
12 | 153173143409 |
13 | 79a267b7a1b |
14 | 39a2ad64321 |
15 | 1cc036a2443 |
hex | f8d7561689 |
1068764632713 has 12 divisors (see below), whose sum is σ = 1543780508400. Its totient is φ = 712505429496.
The previous prime is 1068764632709. The next prime is 1068764632781. The reversal of 1068764632713 is 3172364678601.
It is a happy number.
1068764632713 is a `hidden beast` number, since 106 + 8 + 7 + 6 + 463 + 2 + 71 + 3 = 666.
It is not a de Polignac number, because 1068764632713 - 22 = 1068764632709 is a prime.
It is a super-2 number, since 2×10687646327132 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1068764632713.
It is not an unprimeable number, because it can be changed into a prime (1068764632213) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2059170 + ... + 2525412.
It is an arithmetic number, because the mean of its divisors is an integer number (128648375700).
Almost surely, 21068764632713 is an apocalyptic number.
It is an amenable number.
1068764632713 is a deficient number, since it is larger than the sum of its proper divisors (475015875687).
1068764632713 is a wasteful number, since it uses less digits than its factorization.
1068764632713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 720948 (or 720945 counting only the distinct ones).
The product of its (nonzero) digits is 6096384, while the sum is 54.
The spelling of 1068764632713 in words is "one trillion, sixty-eight billion, seven hundred sixty-four million, six hundred thirty-two thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •