Base | Representation |
---|---|
bin | 11110001111101101000010… |
… | …000111010010011111111111 |
3 | 122102222122021020102022121211 |
4 | 132033231002013102133333 |
5 | 114413402032040101310 |
6 | 1150524443145305251 |
7 | 40006263006331351 |
oct | 3617550207223777 |
9 | 572878236368554 |
10 | 133020541331455 |
11 | 3942577081a298 |
12 | 12b04332195227 |
13 | 592ba2498668b |
14 | 24bc32b2110d1 |
15 | 105a282337c8a |
hex | 78fb421d27ff |
133020541331455 has 32 divisors (see below), whose sum is σ = 164495236815936. Its totient is φ = 103189159471104.
The previous prime is 133020541331417. The next prime is 133020541331479. The reversal of 133020541331455 is 554133145020331.
It is a cyclic number.
It is not a de Polignac number, because 133020541331455 - 237 = 132883102377983 is a prime.
It is a super-2 number, since 2×1330205413314552 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
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, 146494552 + ... + 147399778.
It is an arithmetic number, because the mean of its divisors is an integer number (5140476150498).
Almost surely, 2133020541331455 is an apocalyptic number.
133020541331455 is a deficient number, since it is larger than the sum of its proper divisors (31474695484481).
133020541331455 is a wasteful number, since it uses less digits than its factorization.
133020541331455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 907963.
The product of its (nonzero) digits is 324000, while the sum is 40.
Adding to 133020541331455 its reverse (554133145020331), we get a palindrome (687153686351786).
The spelling of 133020541331455 in words is "one hundred thirty-three trillion, twenty billion, five hundred forty-one million, three hundred thirty-one thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •