Base | Representation |
---|---|
bin | 111110010000110111… |
… | …1111110111000110100 |
3 | 110210010111100120120112 |
4 | 1330201233332320310 |
5 | 4142314303301120 |
6 | 141231533522152 |
7 | 12442315024613 |
oct | 1744157767064 |
9 | 423114316515 |
10 | 133710212660 |
11 | 51784a24892 |
12 | 21ab7343358 |
13 | c7bb762a3b |
14 | 668614787a |
15 | 3728945bc5 |
hex | 1f21bfee34 |
133710212660 has 48 divisors (see below), whose sum is σ = 284709070800. Its totient is φ = 52741100544.
The previous prime is 133710212651. The next prime is 133710212683. The reversal of 133710212660 is 66212017331.
It can be written as a sum of positive squares in 8 ways, for example, as 308494096 + 133401718564 = 17564^2 + 365242^2 .
It is a congruent number.
It is an unprimeable number.
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, 563246 + ... + 764634.
It is an arithmetic number, because the mean of its divisors is an integer number (5931438975).
Almost surely, 2133710212660 is an apocalyptic number.
133710212660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133710212660 is an abundant number, since it is smaller than the sum of its proper divisors (150998858140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133710212660 is a wasteful number, since it uses less digits than its factorization.
133710212660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201860 (or 201858 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 32.
Adding to 133710212660 its reverse (66212017331), we get a palindrome (199922229991).
The spelling of 133710212660 in words is "one hundred thirty-three billion, seven hundred ten million, two hundred twelve thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •