Base | Representation |
---|---|
bin | 10111110011011111… |
… | …00011110111110001 |
3 | 1012222122200122220102 |
4 | 23321233203313301 |
5 | 202133130212243 |
6 | 5512050122145 |
7 | 631461414302 |
oct | 137157436761 |
9 | 35878618812 |
10 | 12779929073 |
11 | 5468a3395a |
12 | 2587b80355 |
13 | 128890ac12 |
14 | 8934407a9 |
15 | 4ebe809b8 |
hex | 2f9be3df1 |
12779929073 has 4 divisors (see below), whose sum is σ = 12834778788. Its totient is φ = 12725079360.
The previous prime is 12779929037. The next prime is 12779929081. The reversal of 12779929073 is 37092997721.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 822943969 + 11956985104 = 28687^2 + 109348^2 .
It is a cyclic number.
It is not a de Polignac number, because 12779929073 - 26 = 12779929009 is a prime.
It is a super-2 number, since 2×127799290732 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12779929973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27424508 + ... + 27424973.
It is an arithmetic number, because the mean of its divisors is an integer number (3208694697).
Almost surely, 212779929073 is an apocalyptic number.
It is an amenable number.
12779929073 is a deficient number, since it is larger than the sum of its proper divisors (54849715).
12779929073 is an equidigital number, since it uses as much as digits as its factorization.
12779929073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54849714.
The product of its (nonzero) digits is 3000564, while the sum is 56.
The spelling of 12779929073 in words is "twelve billion, seven hundred seventy-nine million, nine hundred twenty-nine thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •