Base | Representation |
---|---|
bin | 11110010010101000110001… |
… | …010100010111100011111101 |
3 | 122110200220120210220121121020 |
4 | 132102220301110113203331 |
5 | 114430202401442312201 |
6 | 1151201222020254353 |
7 | 40026660254331063 |
oct | 3622506124274375 |
9 | 573626523817536 |
10 | 133222123010301 |
11 | 394a3204389196 |
12 | 12b3740b5413b9 |
13 | 5944a3b8953a0 |
14 | 24c7db13b8033 |
15 | 106062e58ca36 |
hex | 792a315178fd |
133222123010301 has 32 divisors (see below), whose sum is σ = 192940524564480. Its totient is φ = 81278107684800.
The previous prime is 133222123010293. The next prime is 133222123010321. The reversal of 133222123010301 is 103010321222331.
It is not a de Polignac number, because 133222123010301 - 23 = 133222123010293 is a prime.
It is a super-3 number, since 3×1332221230103013 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133222123010321) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7378581 + ... + 17913338.
It is an arithmetic number, because the mean of its divisors is an integer number (6029391392640).
Almost surely, 2133222123010301 is an apocalyptic number.
It is an amenable number.
133222123010301 is a deficient number, since it is larger than the sum of its proper divisors (59718401554179).
133222123010301 is a wasteful number, since it uses less digits than its factorization.
133222123010301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25293097.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 133222123010301 its reverse (103010321222331), we get a palindrome (236232444232632).
The spelling of 133222123010301 in words is "one hundred thirty-three trillion, two hundred twenty-two billion, one hundred twenty-three million, ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •