Base | Representation |
---|---|
bin | 11110001111101111100001… |
… | …111001100111100100011101 |
3 | 122102222220012001202120212221 |
4 | 132033233201321213210131 |
5 | 114413423024324233201 |
6 | 1150530005151425341 |
7 | 40006416310445656 |
oct | 3617574171474435 |
9 | 572886161676787 |
10 | 133023222102301 |
11 | 39426916a72093 |
12 | 12b0495bb25251 |
13 | 592c06119980b |
14 | 24bc50327a52d |
15 | 105a38c8704a1 |
hex | 78fbe1e6791d |
133023222102301 has 16 divisors (see below), whose sum is σ = 133300999278720. Its totient is φ = 132745821848640.
The previous prime is 133023222102263. The next prime is 133023222102373. The reversal of 133023222102301 is 103201222320331.
It is a cyclic number.
It is not a de Polignac number, because 133023222102301 - 29 = 133023222101789 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133023322102301) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 3497003040 + ... + 3497041078.
It is an arithmetic number, because the mean of its divisors is an integer number (8331312454920).
Almost surely, 2133023222102301 is an apocalyptic number.
It is an amenable number.
133023222102301 is a deficient number, since it is larger than the sum of its proper divisors (277777176419).
133023222102301 is a wasteful number, since it uses less digits than its factorization.
133023222102301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42804.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 133023222102301 its reverse (103201222320331), we get a palindrome (236224444422632).
The spelling of 133023222102301 in words is "one hundred thirty-three trillion, twenty-three billion, two hundred twenty-two million, one hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •