Base | Representation |
---|---|
bin | 10111100011111100… |
… | …01110001101000011 |
3 | 1012122120100221221222 |
4 | 23301332032031003 |
5 | 201401241223010 |
6 | 5451111505255 |
7 | 625316304245 |
oct | 136176161503 |
9 | 35576327858 |
10 | 12649554755 |
11 | 5401386792 |
12 | 255038822b |
13 | 12678c0c56 |
14 | 87ddc4095 |
15 | 4e07cb355 |
hex | 2f1f8e343 |
12649554755 has 4 divisors (see below), whose sum is σ = 15179465712. Its totient is φ = 10119643800.
The previous prime is 12649554751. The next prime is 12649554767. The reversal of 12649554755 is 55745594621.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 55745594621 = 29129 ⋅1913749.
It is not a de Polignac number, because 12649554755 - 22 = 12649554751 is a prime.
It is a super-2 number, since 2×126495547552 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12649554697 and 12649554706.
It is not an unprimeable number, because it can be changed into a prime (12649554751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1264955471 + ... + 1264955480.
It is an arithmetic number, because the mean of its divisors is an integer number (3794866428).
Almost surely, 212649554755 is an apocalyptic number.
12649554755 is a deficient number, since it is larger than the sum of its proper divisors (2529910957).
12649554755 is an equidigital number, since it uses as much as digits as its factorization.
12649554755 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2529910956.
The product of its digits is 7560000, while the sum is 53.
The spelling of 12649554755 in words is "twelve billion, six hundred forty-nine million, five hundred fifty-four thousand, seven hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •