Base | Representation |
---|---|
bin | 11110010111101000001001… |
… | …011100110000110111001110 |
3 | 122111220200202002101011220011 |
4 | 132113220021130300313032 |
5 | 120001312211141144001 |
6 | 1152022534304143434 |
7 | 40063520326420102 |
oct | 3627501134606716 |
9 | 574820662334804 |
10 | 133565051506126 |
11 | 396156905a5809 |
12 | 12b91975607b7a |
13 | 596b1903b36c6 |
14 | 24da8239d9902 |
15 | 10695008a0d51 |
hex | 797a09730dce |
133565051506126 has 8 divisors (see below), whose sum is σ = 210892186588680. Its totient is φ = 63267655976568.
The previous prime is 133565051506099. The next prime is 133565051506141. The reversal of 133565051506126 is 621605150565331.
133565051506126 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1335650515061262 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 133565051506126.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1757434888201 + ... + 1757434888276.
It is an arithmetic number, because the mean of its divisors is an integer number (26361523323585).
Almost surely, 2133565051506126 is an apocalyptic number.
133565051506126 is a deficient number, since it is larger than the sum of its proper divisors (77327135082554).
133565051506126 is a wasteful number, since it uses less digits than its factorization.
133565051506126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3514869776498.
The product of its (nonzero) digits is 2430000, while the sum is 49.
The spelling of 133565051506126 in words is "one hundred thirty-three trillion, five hundred sixty-five billion, fifty-one million, five hundred six thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •