Base | Representation |
---|---|
bin | 101101101110110110110011… |
… | …010001100010010011010000 |
3 | 222101011000221002002112210110 |
4 | 231232312303101202103100 |
5 | 202330321344443113432 |
6 | 1551434440215201320 |
7 | 60236211143044032 |
oct | 5556666321422320 |
9 | 871130832075713 |
10 | 201132031222992 |
11 | 590a5685140261 |
12 | 1a68489a376240 |
13 | 882c8911b912c |
14 | 3794bb11dbc52 |
15 | 183bd8bb47dcc |
hex | b6edb34624d0 |
201132031222992 has 20 divisors (see below), whose sum is σ = 519591080659520. Its totient is φ = 67044010407648.
The previous prime is 201132031222949. The next prime is 201132031223087. The reversal of 201132031222992 is 299222130231102.
201132031222992 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 201132031222992.
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, 2095125325192 + ... + 2095125325287.
It is an arithmetic number, because the mean of its divisors is an integer number (25979554032976).
Almost surely, 2201132031222992 is an apocalyptic number.
It is an amenable number.
201132031222992 is an abundant number, since it is smaller than the sum of its proper divisors (318459049436528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201132031222992 is a wasteful number, since it uses less digits than its factorization.
201132031222992 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4190250650490 (or 4190250650484 counting only the distinct ones).
The product of its (nonzero) digits is 46656, while the sum is 39.
The spelling of 201132031222992 in words is "two hundred one trillion, one hundred thirty-two billion, thirty-one million, two hundred twenty-two thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •