Base | Representation |
---|---|
bin | 111010111000000101… |
… | …1101110000110101001 |
3 | 110002100112222000221122 |
4 | 1311300023232012221 |
5 | 4032420130002301 |
6 | 134030045545025 |
7 | 12064130505563 |
oct | 1656013560651 |
9 | 402315860848 |
10 | 126436172201 |
11 | 49691a175a9 |
12 | 20607275175 |
13 | bbcc74aba1 |
14 | 6196054333 |
15 | 345004981b |
hex | 1d702ee1a9 |
126436172201 has 4 divisors (see below), whose sum is σ = 133090707600. Its totient is φ = 119781636804.
The previous prime is 126436172167. The next prime is 126436172237. The reversal of 126436172201 is 102271634621.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-126436172201 is a prime.
It is a super-2 number, since 2×1264361722012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (126436172251) 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, 3327267671 + ... + 3327267708.
It is an arithmetic number, because the mean of its divisors is an integer number (33272676900).
Almost surely, 2126436172201 is an apocalyptic number.
It is an amenable number.
126436172201 is a deficient number, since it is larger than the sum of its proper divisors (6654535399).
126436172201 is an equidigital number, since it uses as much as digits as its factorization.
126436172201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6654535398.
The product of its (nonzero) digits is 24192, while the sum is 35.
The spelling of 126436172201 in words is "one hundred twenty-six billion, four hundred thirty-six million, one hundred seventy-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •