Base | Representation |
---|---|
bin | 111101000011011000… |
… | …1000010110010011111 |
3 | 110112102021122012221222 |
4 | 1322012301002302133 |
5 | 4122003131203203 |
6 | 140121530443555 |
7 | 12321012541661 |
oct | 1720661026237 |
9 | 415367565858 |
10 | 131110022303 |
11 | 5067020a337 |
12 | 214b05935bb |
13 | c495b54270 |
14 | 64baa96531 |
15 | 3625529038 |
hex | 1e86c42c9f |
131110022303 has 8 divisors (see below), whose sum is σ = 141215386368. Its totient is φ = 121007512224.
The previous prime is 131110022299. The next prime is 131110022311. The reversal of 131110022303 is 303220011131.
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 131110022303 - 22 = 131110022299 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131110022383) 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, 617600 + ... + 802277.
It is an arithmetic number, because the mean of its divisors is an integer number (17651923296).
Almost surely, 2131110022303 is an apocalyptic number.
131110022303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
131110022303 is a deficient number, since it is larger than the sum of its proper divisors (10105364065).
131110022303 is a wasteful number, since it uses less digits than its factorization.
131110022303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1426993.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 131110022303 its reverse (303220011131), we get a palindrome (434330033434).
The spelling of 131110022303 in words is "one hundred thirty-one billion, one hundred ten million, twenty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •