Base | Representation |
---|---|
bin | 11110010011110110011100… |
… | …010010010001001001000111 |
3 | 122110222212212000211021112102 |
4 | 132103312130102101021013 |
5 | 114433034202113003310 |
6 | 1151303413354142315 |
7 | 40036002051133010 |
oct | 3623663422211107 |
9 | 573885760737472 |
10 | 133305522000455 |
11 | 395256109a0942 |
12 | 12b4b60572199b |
13 | 594c86cc5b47c |
14 | 24cc04373a007 |
15 | 10628b11648a5 |
hex | 793d9c491247 |
133305522000455 has 16 divisors (see below), whose sum is σ = 182819899100160. Its totient is φ = 91409052050592.
The previous prime is 133305522000451. The next prime is 133305522000467. The reversal of 133305522000455 is 554000225503331.
It is a cyclic number.
It is not a de Polignac number, because 133305522000455 - 22 = 133305522000451 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133305522000451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2037125 + ... + 16454814.
It is an arithmetic number, because the mean of its divisors is an integer number (11426243693760).
Almost surely, 2133305522000455 is an apocalyptic number.
133305522000455 is a deficient number, since it is larger than the sum of its proper divisors (49514377099705).
133305522000455 is a wasteful number, since it uses less digits than its factorization.
133305522000455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18697918.
The product of its (nonzero) digits is 270000, while the sum is 38.
Adding to 133305522000455 its reverse (554000225503331), we get a palindrome (687305747503786).
The spelling of 133305522000455 in words is "one hundred thirty-three trillion, three hundred five billion, five hundred twenty-two million, four hundred fifty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •