Base | Representation |
---|---|
bin | 10111110101001000… |
… | …00000001111101110 |
3 | 1020000121120010012211 |
4 | 23322210000033232 |
5 | 202200140124112 |
6 | 5513300521034 |
7 | 632016313135 |
oct | 137244001756 |
9 | 36017503184 |
10 | 12793676782 |
11 | 54757737a7 |
12 | 25906b017a |
13 | 128b712563 |
14 | 8951bc91c |
15 | 4ed2990a7 |
hex | 2fa9003ee |
12793676782 has 4 divisors (see below), whose sum is σ = 19190515176. Its totient is φ = 6396838390.
The previous prime is 12793676747. The next prime is 12793676789. The reversal of 12793676782 is 28767639721.
12793676782 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, and also an emirpimes, since its reverse is a distinct semiprime: 28767639721 = 9743 ⋅2952647.
It is a Smith number, since the sum of its digits (58) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12793676789) 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 as a sum of consecutive naturals, namely, 3198419194 + ... + 3198419197.
It is an arithmetic number, because the mean of its divisors is an integer number (4797628794).
Almost surely, 212793676782 is an apocalyptic number.
12793676782 is a deficient number, since it is larger than the sum of its proper divisors (6396838394).
12793676782 is an equidigital number, since it uses as much as digits as its factorization.
12793676782 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6396838393.
The product of its digits is 10668672, while the sum is 58.
The spelling of 12793676782 in words is "twelve billion, seven hundred ninety-three million, six hundred seventy-six thousand, seven hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •