Base | Representation |
---|---|
bin | 11110010011110011001011… |
… | …000001010000011111111111 |
3 | 122110222112210100110012221220 |
4 | 132103303023001100133333 |
5 | 114433010004320300411 |
6 | 1151302033135324423 |
7 | 40035516050036025 |
oct | 3623631301203777 |
9 | 573875710405856 |
10 | 133302011103231 |
11 | 3952407a100893 |
12 | 12b4a9a5980713 |
13 | 594c430777aa9 |
14 | 24cbbcd342715 |
15 | 1062757d03b06 |
hex | 793ccb0507ff |
133302011103231 has 8 divisors (see below), whose sum is σ = 177759843231360. Its totient is φ = 88856093188632.
The previous prime is 133302011103181. The next prime is 133302011103241. The reversal of 133302011103231 is 132301110203331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 133302011103231 - 210 = 133302011102207 is a prime.
It is a super-2 number, since 2×1333020111032312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133302011103241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2978527275 + ... + 2978572028.
It is an arithmetic number, because the mean of its divisors is an integer number (22219980403920).
Almost surely, 2133302011103231 is an apocalyptic number.
133302011103231 is a deficient number, since it is larger than the sum of its proper divisors (44457832128129).
133302011103231 is an equidigital number, since it uses as much as digits as its factorization.
133302011103231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5957106765.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 133302011103231 its reverse (132301110203331), we get a palindrome (265603121306562).
The spelling of 133302011103231 in words is "one hundred thirty-three trillion, three hundred two billion, eleven million, one hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •