Base | Representation |
---|---|
bin | 111011000110100101… |
… | …1011000011010001101 |
3 | 110010121110022021110021 |
4 | 1312031023120122031 |
5 | 4034414142410410 |
6 | 134150224142141 |
7 | 12112155330412 |
oct | 1661513303215 |
9 | 403543267407 |
10 | 126922622605 |
11 | 49911569a29 |
12 | 20722167951 |
13 | bc7946a86c |
14 | 62008c0109 |
15 | 347cad7eda |
hex | 1d8d2d868d |
126922622605 has 4 divisors (see below), whose sum is σ = 152307147132. Its totient is φ = 101538098080.
The previous prime is 126922622543. The next prime is 126922622623. The reversal of 126922622605 is 506226229621.
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 14636644324 + 112285978281 = 120982^2 + 335091^2 .
It is not a de Polignac number, because 126922622605 - 233 = 118332688013 is a prime.
It is a super-2 number, since 2×1269226226052 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 12692262256 + ... + 12692262265.
It is an arithmetic number, because the mean of its divisors is an integer number (38076786783).
Almost surely, 2126922622605 is an apocalyptic number.
It is an amenable number.
126922622605 is a deficient number, since it is larger than the sum of its proper divisors (25384524527).
126922622605 is an equidigital number, since it uses as much as digits as its factorization.
126922622605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25384524526.
The product of its (nonzero) digits is 311040, while the sum is 43.
The spelling of 126922622605 in words is "one hundred twenty-six billion, nine hundred twenty-two million, six hundred twenty-two thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •