Base | Representation |
---|---|
bin | 10000011110010110011… |
… | …110101101000110101001 |
3 | 11000020011001211001212101 |
4 | 100132112132231012221 |
5 | 122022020330432223 |
6 | 2224025142013401 |
7 | 144535342661131 |
oct | 20362636550651 |
9 | 4006131731771 |
10 | 1132101030313 |
11 | 3a7137577210 |
12 | 1634aa417261 |
13 | 829ab52c176 |
14 | 3cb18989ac1 |
15 | 1e6adc974ad |
hex | 107967ad1a9 |
1132101030313 has 4 divisors (see below), whose sum is σ = 1235019305808. Its totient is φ = 1029182754820.
The previous prime is 1132101030259. The next prime is 1132101030337. The reversal of 1132101030313 is 3130301012311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a de Polignac number, because none of the positive numbers 2k-1132101030313 is a prime.
It is a super-2 number, since 2×11321010303132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1132101030353) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51459137731 + ... + 51459137752.
It is an arithmetic number, because the mean of its divisors is an integer number (308754826452).
Almost surely, 21132101030313 is an apocalyptic number.
It is an amenable number.
1132101030313 is a deficient number, since it is larger than the sum of its proper divisors (102918275495).
1132101030313 is a wasteful number, since it uses less digits than its factorization.
1132101030313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102918275494.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1132101030313 its reverse (3130301012311), we get a palindrome (4262402042624).
The spelling of 1132101030313 in words is "one trillion, one hundred thirty-two billion, one hundred one million, thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •