Base | Representation |
---|---|
bin | 111101000011101100… |
… | …0010101011011111111 |
3 | 110112110000000111220110 |
4 | 1322013120111123333 |
5 | 4122013300303203 |
6 | 140122535321103 |
7 | 12321166231065 |
oct | 1720730253377 |
9 | 415400014813 |
10 | 131120322303 |
11 | 50676004933 |
12 | 214b3b20193 |
13 | c49801c539 |
14 | 64bc1b8035 |
15 | 36263b0d03 |
hex | 1e876156ff |
131120322303 has 8 divisors (see below), whose sum is σ = 178892843008. Its totient is φ = 85380674904.
The previous prime is 131120322301. The next prime is 131120322337. The reversal of 131120322303 is 303223021131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131120322303 - 21 = 131120322301 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131120322303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131120322301) 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, 508218175 + ... + 508218432.
It is an arithmetic number, because the mean of its divisors is an integer number (22361605376).
Almost surely, 2131120322303 is an apocalyptic number.
131120322303 is a deficient number, since it is larger than the sum of its proper divisors (47772520705).
131120322303 is a wasteful number, since it uses less digits than its factorization.
131120322303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1016436653.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 131120322303 its reverse (303223021131), we get a palindrome (434343343434).
The spelling of 131120322303 in words is "one hundred thirty-one billion, one hundred twenty million, three hundred twenty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •