Base | Representation |
---|---|
bin | 101101011110110101100000… |
… | …100101001010000111100000 |
3 | 222020020210022112102012200010 |
4 | 231132311200211022013200 |
5 | 202204302224322330422 |
6 | 1545233011125124520 |
7 | 60063525634024011 |
oct | 5536654045120740 |
9 | 866223275365603 |
10 | 200031132230112 |
11 | 588107aa385647 |
12 | 1a527459559740 |
13 | 877cb160aaa11 |
14 | 37577b659b008 |
15 | 181d4072b8b0c |
hex | b5ed6094a1e0 |
200031132230112 has 48 divisors (see below), whose sum is σ = 525134544418512. Its totient is φ = 66670336481280.
The previous prime is 200031132230089. The next prime is 200031132230143. The reversal of 200031132230112 is 211032231130002.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×2000311322301122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 103846873 + ... + 105755544.
It is an arithmetic number, because the mean of its divisors is an integer number (10940303008719).
Almost surely, 2200031132230112 is an apocalyptic number.
It is an amenable number.
200031132230112 is an abundant number, since it is smaller than the sum of its proper divisors (325103412188400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200031132230112 is a wasteful number, since it uses less digits than its factorization.
200031132230112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 209612371 (or 209612363 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 200031132230112 its reverse (211032231130002), we get a palindrome (411063363360114).
The spelling of 200031132230112 in words is "two hundred trillion, thirty-one billion, one hundred thirty-two million, two hundred thirty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.281 sec. • engine limits •