Base | Representation |
---|---|
bin | 10110110110100011… |
… | …01010110111101001 |
3 | 1011200000212102222211 |
4 | 23123101222313221 |
5 | 200111301330222 |
6 | 5345230245121 |
7 | 613013611654 |
oct | 133321526751 |
9 | 34600772884 |
10 | 12268776937 |
11 | 522644a77a |
12 | 24649567a1 |
13 | 1206a4ca31 |
14 | 8455c489b |
15 | 4bc163277 |
hex | 2db46ade9 |
12268776937 has 4 divisors (see below), whose sum is σ = 12990469716. Its totient is φ = 11547084160.
The previous prime is 12268776931. The next prime is 12268776941. The reversal of 12268776937 is 73967786221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 73967786221 = 7 ⋅10566826603.
It can be written as a sum of positive squares in 2 ways, for example, as 7977347856 + 4291429081 = 89316^2 + 65509^2 .
It is a cyclic number.
It is not a de Polignac number, because 12268776937 - 219 = 12268252649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12268776931) 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, 360846364 + ... + 360846397.
It is an arithmetic number, because the mean of its divisors is an integer number (3247617429).
Almost surely, 212268776937 is an apocalyptic number.
12268776937 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
12268776937 is a deficient number, since it is larger than the sum of its proper divisors (721692779).
12268776937 is an equidigital number, since it uses as much as digits as its factorization.
12268776937 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 721692778.
The product of its digits is 10668672, while the sum is 58.
The spelling of 12268776937 in words is "twelve billion, two hundred sixty-eight million, seven hundred seventy-six thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •