Base | Representation |
---|---|
bin | 1001000000010101010000… |
… | …0101011001110111101111 |
3 | 1022001120000100012001212011 |
4 | 2100011110011121313233 |
5 | 2244210340420220421 |
6 | 33020333230422051 |
7 | 2041226462041120 |
oct | 220052405316757 |
9 | 38046010161764 |
10 | 9901310320111 |
11 | 3178138604901 |
12 | 113ab34961927 |
13 | 56a8c6c58232 |
14 | 263324118047 |
15 | 122850c864e1 |
hex | 90154159def |
9901310320111 has 8 divisors (see below), whose sum is σ = 11398380181920. Its totient is φ = 8424889698048.
The previous prime is 9901310320063. The next prime is 9901310320151. The reversal of 9901310320111 is 1110230131099.
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 9901310320111 - 217 = 9901310189039 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 (9901310320151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5162308906 + ... + 5162310823.
It is an arithmetic number, because the mean of its divisors is an integer number (1424797522740).
Almost surely, 29901310320111 is an apocalyptic number.
9901310320111 is a deficient number, since it is larger than the sum of its proper divisors (1497069861809).
9901310320111 is a wasteful number, since it uses less digits than its factorization.
9901310320111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10324619873.
The product of its (nonzero) digits is 1458, while the sum is 31.
The spelling of 9901310320111 in words is "nine trillion, nine hundred one billion, three hundred ten million, three hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •