Base | Representation |
---|---|
bin | 10010100110111011… |
… | …00101111100101011 |
3 | 221210020022210121022 |
4 | 21103131211330223 |
5 | 130424442414011 |
6 | 4331152403055 |
7 | 502365210551 |
oct | 112335457453 |
9 | 27706283538 |
10 | 9990201131 |
11 | 4267231a79 |
12 | 1b2984648b |
13 | c32969321 |
14 | 6aab31bd1 |
15 | 3d70c48db |
hex | 253765f2b |
9990201131 has 4 divisors (see below), whose sum is σ = 9991184064. Its totient is φ = 9989218200.
The previous prime is 9990201049. The next prime is 9990201161. The reversal of 9990201131 is 1311020999.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1311020999 = 23 ⋅57000913.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-9990201131 is a prime.
It is a super-2 number, since 2×99902011312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 9990201091 and 9990201100.
It is not an unprimeable number, because it can be changed into a prime (9990201161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 476060 + ... + 496601.
It is an arithmetic number, because the mean of its divisors is an integer number (2497796016).
Almost surely, 29990201131 is an apocalyptic number.
9990201131 is a deficient number, since it is larger than the sum of its proper divisors (982933).
9990201131 is a wasteful number, since it uses less digits than its factorization.
9990201131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 982932.
The product of its (nonzero) digits is 4374, while the sum is 35.
The square root of 9990201131 is about 99950.9936468868. The cubic root of 9990201131 is about 2153.7307592811.
The spelling of 9990201131 in words is "nine billion, nine hundred ninety million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •