Base | Representation |
---|---|
bin | 111011001010100000… |
… | …0000111000111010111 |
3 | 110010221121022010212012 |
4 | 1312111000013013113 |
5 | 4040201243322121 |
6 | 134211233414435 |
7 | 12115341132311 |
oct | 1662500070727 |
9 | 403847263765 |
10 | 127053885911 |
11 | 49979673aa7 |
12 | 2075a10a41b |
13 | bc9a709364 |
14 | 62140cc7b1 |
15 | 34893b5c5b |
hex | 1d950071d7 |
127053885911 has 4 divisors (see below), whose sum is σ = 127054771992. Its totient is φ = 127052999832.
The previous prime is 127053885883. The next prime is 127053885953. The reversal of 127053885911 is 119588350721.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-127053885911 is a prime.
It is a super-2 number, since 2×1270538859112 (a number of 23 digits) contains 22 as substring.
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 127053885911.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (127053885811) 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, 173156 + ... + 533001.
It is an arithmetic number, because the mean of its divisors is an integer number (31763692998).
Almost surely, 2127053885911 is an apocalyptic number.
127053885911 is a deficient number, since it is larger than the sum of its proper divisors (886081).
127053885911 is an equidigital number, since it uses as much as digits as its factorization.
127053885911 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 886080.
The product of its (nonzero) digits is 604800, while the sum is 50.
The spelling of 127053885911 in words is "one hundred twenty-seven billion, fifty-three million, eight hundred eighty-five thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •