Base | Representation |
---|---|
bin | 101101100001010010110010… |
… | …000001011000111111110101 |
3 | 222020211221012101021002222022 |
4 | 231201102302001120333311 |
5 | 202220034101042411013 |
6 | 1545442340021042525 |
7 | 60111654455022560 |
oct | 5541226201307765 |
9 | 866757171232868 |
10 | 200200002310133 |
11 | 58876387112151 |
12 | 1a554127856445 |
13 | 8792a18c096a7 |
14 | 3761a361474d7 |
15 | 18229dc81d008 |
hex | b614b2058ff5 |
200200002310133 has 32 divisors (see below), whose sum is σ = 236926738298880. Its totient is φ = 165597782077440.
The previous prime is 200200002310129. The next prime is 200200002310171. The reversal of 200200002310133 is 331013200002002.
200200002310133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 200200002310133 - 22 = 200200002310129 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200200002310103) 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, 48778103 + ... + 52722891.
It is an arithmetic number, because the mean of its divisors is an integer number (7403960571840).
Almost surely, 2200200002310133 is an apocalyptic number.
It is an amenable number.
200200002310133 is a deficient number, since it is larger than the sum of its proper divisors (36726735988747).
200200002310133 is a wasteful number, since it uses less digits than its factorization.
200200002310133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3946757.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 200200002310133 its reverse (331013200002002), we get a palindrome (531213202312135).
The spelling of 200200002310133 in words is "two hundred trillion, two hundred billion, two million, three hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •