Base | Representation |
---|---|
bin | 1001000000010100011110… |
… | …0110111101000010111100 |
3 | 1022001112110202100001220202 |
4 | 2100011013212331002330 |
5 | 2244204423324324012 |
6 | 33020300352303032 |
7 | 2041221340662632 |
oct | 220050746750274 |
9 | 38045422301822 |
10 | 9901101011132 |
11 | 3178040443981 |
12 | 113aa96841a78 |
13 | 56a892791a76 |
14 | 2633043d1352 |
15 | 12283c6ddcc2 |
hex | 901479bd0bc |
9901101011132 has 12 divisors (see below), whose sum is σ = 17327024869560. Its totient is φ = 4950522476976.
The previous prime is 9901101011093. The next prime is 9901101011141. The reversal of 9901101011132 is 2311101011099.
It is a super-2 number, since 2×99011010111322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 9901101011095 and 9901101011104.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6202058 + ... + 7633329.
It is an arithmetic number, because the mean of its divisors is an integer number (1443918739130).
Almost surely, 29901101011132 is an apocalyptic number.
It is an amenable number.
9901101011132 is a deficient number, since it is larger than the sum of its proper divisors (7425923858428).
9901101011132 is a wasteful number, since it uses less digits than its factorization.
9901101011132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14014300 (or 14014298 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 29.
The spelling of 9901101011132 in words is "nine trillion, nine hundred one billion, one hundred one million, eleven thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •