Base | Representation |
---|---|
bin | 11000010001000001… |
… | …11011101011010111 |
3 | 1020121221000101221220 |
4 | 30020200323223113 |
5 | 203140101041123 |
6 | 5552421541423 |
7 | 640561033122 |
oct | 141040735327 |
9 | 36557011856 |
10 | 13027752663 |
11 | 5585910442 |
12 | 2636b74873 |
13 | 12c806aab3 |
14 | 8b83113b9 |
15 | 513ad4ce3 |
hex | 30883bad7 |
13027752663 has 4 divisors (see below), whose sum is σ = 17370336888. Its totient is φ = 8685168440.
The previous prime is 13027752659. The next prime is 13027752701. The reversal of 13027752663 is 36625772031.
13027752663 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13027752663 - 22 = 13027752659 is a prime.
It is a super-3 number, since 3×130277526633 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13027752163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2171292108 + ... + 2171292113.
It is an arithmetic number, because the mean of its divisors is an integer number (4342584222).
Almost surely, 213027752663 is an apocalyptic number.
13027752663 is a deficient number, since it is larger than the sum of its proper divisors (4342584225).
13027752663 is an equidigital number, since it uses as much as digits as its factorization.
13027752663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4342584224.
The product of its (nonzero) digits is 317520, while the sum is 42.
The spelling of 13027752663 in words is "thirteen billion, twenty-seven million, seven hundred fifty-two thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •