Base | Representation |
---|---|
bin | 111101000110010111… |
… | …1101001110110010111 |
3 | 110112200021100221022202 |
4 | 1322030233221312113 |
5 | 4122204320240203 |
6 | 140135512315115 |
7 | 12323341220615 |
oct | 1721457516627 |
9 | 415607327282 |
10 | 131210321303 |
11 | 50711895476 |
12 | 2151a0a2a9b |
13 | c4b0870b99 |
14 | 64ca1246b5 |
15 | 362e23c388 |
hex | 1e8cbe9d97 |
131210321303 has 8 divisors (see below), whose sum is σ = 134964673536. Its totient is φ = 127487921400.
The previous prime is 131210321287. The next prime is 131210321311. The reversal of 131210321303 is 303123012131.
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 131210321303 - 24 = 131210321287 is a prime.
It is a super-2 number, since 2×1312103213032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131210321323) 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, 7979753 + ... + 7996178.
It is an arithmetic number, because the mean of its divisors is an integer number (16870584192).
Almost surely, 2131210321303 is an apocalyptic number.
131210321303 is a deficient number, since it is larger than the sum of its proper divisors (3754352233).
131210321303 is a wasteful number, since it uses less digits than its factorization.
131210321303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15976165.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 131210321303 its reverse (303123012131), we get a palindrome (434333333434).
The spelling of 131210321303 in words is "one hundred thirty-one billion, two hundred ten million, three hundred twenty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •