Base | Representation |
---|---|
bin | 111011000100101011… |
… | …1000100010001001011 |
3 | 110010102222210102100202 |
4 | 1312021113010101023 |
5 | 4034301243430341 |
6 | 134140015322415 |
7 | 12110450053430 |
oct | 1661127042113 |
9 | 403388712322 |
10 | 126858576971 |
11 | 498893a5555 |
12 | 2070482040b |
13 | bc69105339 |
14 | 61d61abb87 |
15 | 347718679b |
hex | 1d895c444b |
126858576971 has 8 divisors (see below), whose sum is σ = 152611822080. Its totient is φ = 103012979688.
The previous prime is 126858576959. The next prime is 126858576979. The reversal of 126858576971 is 179675858621.
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 126858576971 - 226 = 126791468107 is a prime.
It is a super-2 number, since 2×1268585769712 (a number of 23 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 = 126858576898 and 126858576907.
It is not an unprimeable number, because it can be changed into a prime (126858576979) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 476911811 + ... + 476912076.
It is an arithmetic number, because the mean of its divisors is an integer number (19076477760).
Almost surely, 2126858576971 is an apocalyptic number.
126858576971 is a deficient number, since it is larger than the sum of its proper divisors (25753245109).
126858576971 is an equidigital number, since it uses as much as digits as its factorization.
126858576971 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 953823913.
The product of its digits is 50803200, while the sum is 65.
The spelling of 126858576971 in words is "one hundred twenty-six billion, eight hundred fifty-eight million, five hundred seventy-six thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •