Base | Representation |
---|---|
bin | 111101001001011110… |
… | …0010011110101011111 |
3 | 110112221112000201102220 |
4 | 1322102330103311133 |
5 | 4122412430133203 |
6 | 140154105120423 |
7 | 12326043103332 |
oct | 1722274236537 |
9 | 415845021386 |
10 | 131314302303 |
11 | 50765555988 |
12 | 21548a89113 |
13 | c4c92796c2 |
14 | 64d9c70619 |
15 | 363842b653 |
hex | 1e92f13d5f |
131314302303 has 8 divisors (see below), whose sum is σ = 175101936048. Its totient is φ = 87534768384.
The previous prime is 131314302283. The next prime is 131314302373. The reversal of 131314302303 is 303203413131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131314302303 - 26 = 131314302239 is a prime.
It is a super-2 number, since 2×1313143023032 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131314302373) 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, 1987026 + ... + 2052047.
It is an arithmetic number, because the mean of its divisors is an integer number (21887742006).
Almost surely, 2131314302303 is an apocalyptic number.
131314302303 is a deficient number, since it is larger than the sum of its proper divisors (43787633745).
131314302303 is a wasteful number, since it uses less digits than its factorization.
131314302303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4049913.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 131314302303 its reverse (303203413131), we get a palindrome (434517715434).
The spelling of 131314302303 in words is "one hundred thirty-one billion, three hundred fourteen million, three hundred two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •