Base | Representation |
---|---|
bin | 110100100111110000… |
… | …0011000110110000011 |
3 | 101210200101011012222122 |
4 | 1221033200120312003 |
5 | 3322412234241011 |
6 | 123525103154455 |
7 | 11110214664332 |
oct | 1511740306603 |
9 | 353611135878 |
10 | 113003040131 |
11 | 43a192a7663 |
12 | 19a985a5a2b |
13 | a86b707127 |
14 | 567dd7bd19 |
15 | 2e15a8c3db |
hex | 1a4f818d83 |
113003040131 has 4 divisors (see below), whose sum is σ = 113003722152. Its totient is φ = 113002358112.
The previous prime is 113003040109. The next prime is 113003040173. The reversal of 113003040131 is 131040300311.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113003040131 is a prime.
It is a super-2 number, since 2×1130030401312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113003040431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 84536 + ... + 482858.
It is an arithmetic number, because the mean of its divisors is an integer number (28250930538).
Almost surely, 2113003040131 is an apocalyptic number.
113003040131 is a deficient number, since it is larger than the sum of its proper divisors (682021).
113003040131 is an equidigital number, since it uses as much as digits as its factorization.
113003040131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 682020.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 113003040131 its reverse (131040300311), we get a palindrome (244043340442).
The spelling of 113003040131 in words is "one hundred thirteen billion, three million, forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •