Base | Representation |
---|---|
bin | 11110001111101111011110… |
… | …011001100000111000000111 |
3 | 122102222220000222012220020022 |
4 | 132033233132121200320013 |
5 | 114413422414304322011 |
6 | 1150525555252325355 |
7 | 40006414665215654 |
oct | 3617573631407007 |
9 | 572886028186208 |
10 | 133023163354631 |
11 | 394268968970a0 |
12 | 12b0494431385b |
13 | 592c051c6a894 |
14 | 24bc4d9546c2b |
15 | 105a3876188db |
hex | 78fbde660e07 |
133023163354631 has 16 divisors (see below), whose sum is σ = 147107177280288. Its totient is φ = 119271052569600.
The previous prime is 133023163354603. The next prime is 133023163354661. The reversal of 133023163354631 is 136453361320331.
It is a de Polignac number, because none of the positive numbers 2k-133023163354631 is a prime.
It is a super-2 number, since 2×1330231633546312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133023163354661) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36832661 + ... + 40282641.
It is an arithmetic number, because the mean of its divisors is an integer number (9194198580018).
Almost surely, 2133023163354631 is an apocalyptic number.
133023163354631 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
133023163354631 is a deficient number, since it is larger than the sum of its proper divisors (14084013925657).
133023163354631 is a wasteful number, since it uses less digits than its factorization.
133023163354631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3498082.
The product of its (nonzero) digits is 1049760, while the sum is 44.
The spelling of 133023163354631 in words is "one hundred thirty-three trillion, twenty-three billion, one hundred sixty-three million, three hundred fifty-four thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •