Base | Representation |
---|---|
bin | 111101001001011011… |
… | …1110001000100000111 |
3 | 110112221102210012200210 |
4 | 1322102313301010013 |
5 | 4122412124030203 |
6 | 140154023410503 |
7 | 12326030013123 |
oct | 1722267610407 |
9 | 415842705623 |
10 | 131313111303 |
11 | 50764912090 |
12 | 215485b3a33 |
13 | c4c8c5057a |
14 | 64d9a40583 |
15 | 3638293803 |
hex | 1e92df1107 |
131313111303 has 8 divisors (see below), whose sum is σ = 191000889216. Its totient is φ = 79583703800.
The previous prime is 131313111299. The next prime is 131313111323. The reversal of 131313111303 is 303111313131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131313111303 - 22 = 131313111299 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131313111303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131313111323) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1989592563 + ... + 1989592628.
It is an arithmetic number, because the mean of its divisors is an integer number (23875111152).
Almost surely, 2131313111303 is an apocalyptic number.
131313111303 is a deficient number, since it is larger than the sum of its proper divisors (59687777913).
131313111303 is a wasteful number, since it uses less digits than its factorization.
131313111303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3979185205.
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 131313111303 its reverse (303111313131), we get a palindrome (434424424434).
The spelling of 131313111303 in words is "one hundred thirty-one billion, three hundred thirteen million, one hundred eleven thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •