Base | Representation |
---|---|
bin | 11110001111101101000001… |
… | …110100110111000100001000 |
3 | 122102222122020220022212210010 |
4 | 132033231001310313010020 |
5 | 114413402024321003423 |
6 | 1150524442453551520 |
7 | 40006262620301040 |
oct | 3617550164670410 |
9 | 572878226285703 |
10 | 133020536500488 |
11 | 3942576901a75a |
12 | 12b043306455a0 |
13 | 592ba23984810 |
14 | 24bc32a714720 |
15 | 105a281bd1693 |
hex | 78fb41d37108 |
133020536500488 has 64 divisors (see below), whose sum is σ = 409293958469760. Its totient is φ = 35082339296256.
The previous prime is 133020536500487. The next prime is 133020536500589. The reversal of 133020536500488 is 884005635020331.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (133020536500487) 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, 30453417345 + ... + 30453421712.
It is an arithmetic number, because the mean of its divisors is an integer number (6395218101090).
Almost surely, 2133020536500488 is an apocalyptic number.
It is an amenable number.
133020536500488 is an abundant number, since it is smaller than the sum of its proper divisors (276273421969272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133020536500488 is a wasteful number, since it uses less digits than its factorization.
133020536500488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60906839086 (or 60906839082 counting only the distinct ones).
The product of its (nonzero) digits is 2073600, while the sum is 48.
The spelling of 133020536500488 in words is "one hundred thirty-three trillion, twenty billion, five hundred thirty-six million, five hundred thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •