Base | Representation |
---|---|
bin | 111010110011100111… |
… | …1101100000000011001 |
3 | 110001222002210112102020 |
4 | 1311213033230000121 |
5 | 4032113232422431 |
6 | 134003131525053 |
7 | 12060330064242 |
oct | 1654717540031 |
9 | 401862715366 |
10 | 126286217241 |
11 | 49615306188 |
12 | 20584bb9789 |
13 | bba7666642 |
14 | 618017bcc9 |
15 | 3441cc8696 |
hex | 1d673ec019 |
126286217241 has 8 divisors (see below), whose sum is σ = 169926408960. Its totient is φ = 83418418512.
The previous prime is 126286217227. The next prime is 126286217257. The reversal of 126286217241 is 142712682621.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 126286217241 - 29 = 126286216729 is a prime.
It is a nialpdrome in base 13.
It is a junction number, because it is equal to n+sod(n) for n = 126286217193 and 126286217202.
It is not an unprimeable number, because it can be changed into a prime (126286215241) 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 7 ways as a sum of consecutive naturals, for example, 193097865 + ... + 193098518.
It is an arithmetic number, because the mean of its divisors is an integer number (21240801120).
Almost surely, 2126286217241 is an apocalyptic number.
It is an amenable number.
126286217241 is a deficient number, since it is larger than the sum of its proper divisors (43640191719).
126286217241 is a wasteful number, since it uses less digits than its factorization.
126286217241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 386196495.
The product of its digits is 129024, while the sum is 42.
Adding to 126286217241 its reverse (142712682621), we get a palindrome (268998899862).
The spelling of 126286217241 in words is "one hundred twenty-six billion, two hundred eighty-six million, two hundred seventeen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •