Base | Representation |
---|---|
bin | 111010110101111110… |
… | …1000111101101010101 |
3 | 110002011121111002211220 |
4 | 1311223331013231111 |
5 | 4032244000023203 |
6 | 134015033320553 |
7 | 12062306532630 |
oct | 1655375075525 |
9 | 402147432756 |
10 | 126365236053 |
11 | 49655977191 |
12 | 205a7566159 |
13 | bbbab42234 |
14 | 618a86ac17 |
15 | 3448bd6653 |
hex | 1d6bf47b55 |
126365236053 has 8 divisors (see below), whose sum is σ = 192556550208. Its totient is φ = 72208706304.
The previous prime is 126365236027. The next prime is 126365236073. The reversal of 126365236053 is 350632563621.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 126365236053 - 26 = 126365235989 is a prime.
It is a super-2 number, since 2×1263652360532 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 126365235996 and 126365236014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126365236073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3008696076 + ... + 3008696117.
It is an arithmetic number, because the mean of its divisors is an integer number (24069568776).
Almost surely, 2126365236053 is an apocalyptic number.
It is an amenable number.
126365236053 is a deficient number, since it is larger than the sum of its proper divisors (66191314155).
126365236053 is an equidigital number, since it uses as much as digits as its factorization.
126365236053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6017392203.
The product of its (nonzero) digits is 583200, while the sum is 42.
Adding to 126365236053 its reverse (350632563621), we get a palindrome (476997799674).
The spelling of 126365236053 in words is "one hundred twenty-six billion, three hundred sixty-five million, two hundred thirty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •