Base | Representation |
---|---|
bin | 101101011110110100100011… |
… | …101010001010001110111100 |
3 | 222020020200200022011012110100 |
4 | 231132310203222022032330 |
5 | 202204243131143144012 |
6 | 1545232321454041100 |
7 | 60063461413232421 |
oct | 5536644352121674 |
9 | 866220608135410 |
10 | 200030110131132 |
11 | 58810325438546 |
12 | 1a5272131a9190 |
13 | 877c9b2403c18 |
14 | 375771a939d48 |
15 | 181d3976be8dc |
hex | b5ed23a8a3bc |
200030110131132 has 18 divisors (see below), whose sum is σ = 505631667276008. Its totient is φ = 66676703377032.
The previous prime is 200030110131079. The next prime is 200030110131143. The reversal of 200030110131132 is 231131011030002.
200030110131132 is a `hidden beast` number, since 20 + 0 + 0 + 301 + 1 + 0 + 1 + 311 + 32 = 666.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2778195974008 + ... + 2778195974079.
Almost surely, 2200030110131132 is an apocalyptic number.
It is an amenable number.
200030110131132 is an abundant number, since it is smaller than the sum of its proper divisors (305601557144876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200030110131132 is a wasteful number, since it uses less digits than its factorization.
200030110131132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5556391948097 (or 5556391948092 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 200030110131132 its reverse (231131011030002), we get a palindrome (431161121161134).
The spelling of 200030110131132 in words is "two hundred trillion, thirty billion, one hundred ten million, one hundred thirty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •