Base | Representation |
---|---|
bin | 11100110100001111100… |
… | …11111010010000011010 |
3 | 10111122200020100202011000 |
4 | 32122013303322100122 |
5 | 112210231434311302 |
6 | 2034504425245430 |
7 | 131351056503342 |
oct | 16320763722032 |
9 | 3448606322130 |
10 | 990121010202 |
11 | 3519a9552715 |
12 | 13ba85633876 |
13 | 724a269a04c |
14 | 35cca3c3d22 |
15 | 1ab4e30d31c |
hex | e687cfa41a |
990121010202 has 64 divisors (see below), whose sum is σ = 2296211512320. Its totient is φ = 315652431600.
The previous prime is 990121010189. The next prime is 990121010209. The reversal of 990121010202 is 202010121099.
It is a super-2 number, since 2×9901210102022 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (990121010209) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11247177 + ... + 11334867.
It is an arithmetic number, because the mean of its divisors is an integer number (35878304880).
Almost surely, 2990121010202 is an apocalyptic number.
990121010202 is an abundant number, since it is smaller than the sum of its proper divisors (1306090502118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
990121010202 is a wasteful number, since it uses less digits than its factorization.
990121010202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96816 (or 96810 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 27.
The spelling of 990121010202 in words is "nine hundred ninety billion, one hundred twenty-one million, ten thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •