Base | Representation |
---|---|
bin | 10010100001011100001… |
… | …000101111111101000101 |
3 | 11111200110112100022220102 |
4 | 102201130020233331011 |
5 | 131323302131221221 |
6 | 2412424140013445 |
7 | 160650363323414 |
oct | 22413410577505 |
9 | 4450415308812 |
10 | 1272856117061 |
11 | 4508a7105191 |
12 | 186830b31285 |
13 | 9305067a049 |
14 | 4586c5b147b |
15 | 2319ae1d30b |
hex | 1285c22ff45 |
1272856117061 has 8 divisors (see below), whose sum is σ = 1328218153920. Its totient is φ = 1217495785792.
The previous prime is 1272856117019. The next prime is 1272856117069. The reversal of 1272856117061 is 1607116582721.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1272856117061 - 26 = 1272856116997 is a prime.
It is a super-2 number, since 2×12728561170612 (a number of 25 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 = 1272856116997 and 1272856117015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1272856117069) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1236686 + ... + 2018688.
It is an arithmetic number, because the mean of its divisors is an integer number (166027269240).
Almost surely, 21272856117061 is an apocalyptic number.
It is an amenable number.
1272856117061 is a deficient number, since it is larger than the sum of its proper divisors (55362036859).
1272856117061 is an equidigital number, since it uses as much as digits as its factorization.
1272856117061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 852795.
The product of its (nonzero) digits is 282240, while the sum is 47.
The spelling of 1272856117061 in words is "one trillion, two hundred seventy-two billion, eight hundred fifty-six million, one hundred seventeen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •