Base | Representation |
---|---|
bin | 10110110110101101… |
… | …01111100010000101 |
3 | 1011200010101000011102 |
4 | 23123112233202011 |
5 | 200112121404012 |
6 | 5345314545445 |
7 | 613031120666 |
oct | 133326574205 |
9 | 34603330142 |
10 | 12270106757 |
11 | 52271788a7 |
12 | 2465298285 |
13 | 12070c70cc |
14 | 84584d36d |
15 | 4bc3272c2 |
hex | 2db5af885 |
12270106757 has 4 divisors (see below), whose sum is σ = 12298444620. Its totient is φ = 12241768896.
The previous prime is 12270106733. The next prime is 12270106763. The reversal of 12270106757 is 75760107221.
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 6541736161 + 5728370596 = 80881^2 + 75686^2 .
It is a cyclic number.
It is not a de Polignac number, because 12270106757 - 212 = 12270102661 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12270106757.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12270106357) 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, 14168282 + ... + 14169147.
It is an arithmetic number, because the mean of its divisors is an integer number (3074611155).
Almost surely, 212270106757 is an apocalyptic number.
It is an amenable number.
12270106757 is a deficient number, since it is larger than the sum of its proper divisors (28337863).
12270106757 is an equidigital number, since it uses as much as digits as its factorization.
12270106757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28337862.
The product of its (nonzero) digits is 41160, while the sum is 38.
The spelling of 12270106757 in words is "twelve billion, two hundred seventy million, one hundred six thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •