Base | Representation |
---|---|
bin | 10000011110010110011… |
… | …011001100011111011101 |
3 | 11000020011000002022211212 |
4 | 100132112123030133131 |
5 | 122022020112012201 |
6 | 2224025110154205 |
7 | 144535332106646 |
oct | 20362633143735 |
9 | 4006130068755 |
10 | 1132100110301 |
11 | 3a7136aa8a76 |
12 | 1634aa052965 |
13 | 829ab299494 |
14 | 3cb187ca6cd |
15 | 1e6adb64abb |
hex | 107966cc7dd |
1132100110301 has 8 divisors (see below), whose sum is σ = 1134699434880. Its totient is φ = 1129501451232.
The previous prime is 1132100110279. The next prime is 1132100110303. The reversal of 1132100110301 is 1030110012311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1132100110301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132100110303) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 3323546 + ... + 3648308.
It is an arithmetic number, because the mean of its divisors is an integer number (141837429360).
Almost surely, 21132100110301 is an apocalyptic number.
It is an amenable number.
1132100110301 is a deficient number, since it is larger than the sum of its proper divisors (2599324579).
1132100110301 is an equidigital number, since it uses as much as digits as its factorization.
1132100110301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332755.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 1132100110301 its reverse (1030110012311), we get a palindrome (2162210122612).
The spelling of 1132100110301 in words is "one trillion, one hundred thirty-two billion, one hundred million, one hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •