Base | Representation |
---|---|
bin | 11110001111101111011110… |
… | …011001110011101000010101 |
3 | 122102222220000222100210121021 |
4 | 132033233132121303220111 |
5 | 114413422414314301240 |
6 | 1150525555254121141 |
7 | 40006414665655630 |
oct | 3617573631635025 |
9 | 572886028323537 |
10 | 133023163431445 |
11 | 39426896939881 |
12 | 12b049443501b1 |
13 | 592c051c96831 |
14 | 24bc4d9566c17 |
15 | 105a38763154a |
hex | 78fbde673a15 |
133023163431445 has 32 divisors (see below), whose sum is σ = 183643008546816. Its totient is φ = 90610283016000.
The previous prime is 133023163431421. The next prime is 133023163431493. The reversal of 133023163431445 is 544134361320331.
It is not a de Polignac number, because 133023163431445 - 29 = 133023163430933 is a prime.
It is a super-3 number, since 3×1330231634314453 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 378795990 + ... + 379147000.
It is an arithmetic number, because the mean of its divisors is an integer number (5738844017088).
Almost surely, 2133023163431445 is an apocalyptic number.
It is an amenable number.
133023163431445 is a deficient number, since it is larger than the sum of its proper divisors (50619845115371).
133023163431445 is a wasteful number, since it uses less digits than its factorization.
133023163431445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422881.
The product of its (nonzero) digits is 933120, while the sum is 43.
It can be divided in two parts, 13302316 and 3431445, that added together give a palindrome (16733761).
The spelling of 133023163431445 in words is "one hundred thirty-three trillion, twenty-three billion, one hundred sixty-three million, four hundred thirty-one thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •