Base | Representation |
---|---|
bin | 111110001010010010… |
… | …0100010000001101010 |
3 | 110202120002022020200212 |
4 | 1330110210202001222 |
5 | 4141341202411200 |
6 | 141153554501122 |
7 | 12433661455055 |
oct | 1742444420152 |
9 | 422502266625 |
10 | 133489107050 |
11 | 51681136982 |
12 | 21a552947a2 |
13 | c7849c9010 |
14 | 6664a2da9c |
15 | 371431d035 |
hex | 1f1492206a |
133489107050 has 24 divisors (see below), whose sum is σ = 267388951116. Its totient is φ = 49288285440.
The previous prime is 133489107019. The next prime is 133489107061. The reversal of 133489107050 is 50701984331.
It can be written as a sum of positive squares in 6 ways, for example, as 2797457881 + 130691649169 = 52891^2 + 361513^2 .
It is a junction number, because it is equal to n+sod(n) for n = 133489106989 and 133489107007.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 102683279 + ... + 102684578.
Almost surely, 2133489107050 is an apocalyptic number.
133489107050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133489107050 is an abundant number, since it is smaller than the sum of its proper divisors (133899844066).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133489107050 is a wasteful number, since it uses less digits than its factorization.
133489107050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205367882 (or 205367877 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 41.
The spelling of 133489107050 in words is "one hundred thirty-three billion, four hundred eighty-nine million, one hundred seven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •