Base | Representation |
---|---|
bin | 111110000101010010… |
… | …0110100110110101010 |
3 | 110202010101202110100110 |
4 | 1330022210310312222 |
5 | 4141020240141020 |
6 | 141125204315150 |
7 | 12426554206203 |
oct | 1741244646652 |
9 | 422111673313 |
10 | 133321412010 |
11 | 515a5509136 |
12 | 21a090a2ab6 |
13 | c759042b97 |
14 | 664a65a5aa |
15 | 37047458e0 |
hex | 1f0a934daa |
133321412010 has 64 divisors (see below), whose sum is σ = 330519481344. Its totient is φ = 34381939200.
The previous prime is 133321411981. The next prime is 133321412033. The reversal of 133321412010 is 10214123331.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1328932 + ... + 1425728.
It is an arithmetic number, because the mean of its divisors is an integer number (5164366896).
Almost surely, 2133321412010 is an apocalyptic number.
133321412010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 133321412010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (165259740672).
133321412010 is an abundant number, since it is smaller than the sum of its proper divisors (197198069334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133321412010 is a wasteful number, since it uses less digits than its factorization.
133321412010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98319.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 133321412010 its reverse (10214123331), we get a palindrome (143535535341).
The spelling of 133321412010 in words is "one hundred thirty-three billion, three hundred twenty-one million, four hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •