Base | Representation |
---|---|
bin | 11110010001000011011010… |
… | …111110011100101001101010 |
3 | 122110022111200202200011011020 |
4 | 132101003122332130221222 |
5 | 114421412014330203002 |
6 | 1151035223402513310 |
7 | 40016055446134104 |
oct | 3621033276345152 |
9 | 573274622604136 |
10 | 133113300241002 |
11 | 39461040802a14 |
12 | 12b1a2bab05836 |
13 | 59376b8249bc3 |
14 | 24c2a0a6b8574 |
15 | 105c8b09d42bc |
hex | 7910daf9ca6a |
133113300241002 has 32 divisors (see below), whose sum is σ = 270055376196480. Its totient is φ = 43733337023040.
The previous prime is 133113300240997. The next prime is 133113300241007. The reversal of 133113300241002 is 200142003311331.
It is an interprime number because it is at equal distance from previous prime (133113300240997) and next prime (133113300241007).
It is a super-2 number, since 2×1331133002410022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (133113300241007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 44322877 + ... + 47230752.
It is an arithmetic number, because the mean of its divisors is an integer number (8439230506140).
Almost surely, 2133113300241002 is an apocalyptic number.
133113300241002 is an abundant number, since it is smaller than the sum of its proper divisors (136942075955478).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133113300241002 is a wasteful number, since it uses less digits than its factorization.
133113300241002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91557118.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 133113300241002 its reverse (200142003311331), we get a palindrome (333255303552333).
The spelling of 133113300241002 in words is "one hundred thirty-three trillion, one hundred thirteen billion, three hundred million, two hundred forty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.175 sec. • engine limits •