Base | Representation |
---|---|
bin | 111010110100101101… |
… | …0101010110010000011 |
3 | 110002001122100112002200 |
4 | 1311221122222302003 |
5 | 4032202044301433 |
6 | 134010512444243 |
7 | 12061251545016 |
oct | 1655132526203 |
9 | 402048315080 |
10 | 126322650243 |
11 | 4963392a8a9 |
12 | 20595249683 |
13 | bbb208172a |
14 | 6184d4337d |
15 | 34450c3613 |
hex | 1d696aac83 |
126322650243 has 48 divisors (see below), whose sum is σ = 194121308160. Its totient is φ = 78980945472.
The previous prime is 126322650217. The next prime is 126322650257. The reversal of 126322650243 is 342056223621.
126322650243 is a `hidden beast` number, since 12 + 632 + 2 + 6 + 5 + 0 + 2 + 4 + 3 = 666.
It is not a de Polignac number, because 126322650243 - 217 = 126322519171 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 126322650198 and 126322650207.
It is not an unprimeable number, because it can be changed into a prime (126322650143) 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 47 ways as a sum of consecutive naturals, for example, 22367046 + ... + 22372692.
It is an arithmetic number, because the mean of its divisors is an integer number (4044193920).
Almost surely, 2126322650243 is an apocalyptic number.
126322650243 is a deficient number, since it is larger than the sum of its proper divisors (67798657917).
126322650243 is a wasteful number, since it uses less digits than its factorization.
126322650243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7768 (or 7765 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 36.
Adding to 126322650243 its reverse (342056223621), we get a palindrome (468378873864).
The spelling of 126322650243 in words is "one hundred twenty-six billion, three hundred twenty-two million, six hundred fifty thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •