Base | Representation |
---|---|
bin | 101111110010110100001110… |
… | …000111010100011001101101 |
3 | 1000120020221112112020212010022 |
4 | 233302310032013110121231 |
5 | 210022410033143430013 |
6 | 2023020353024451525 |
7 | 62163315453246161 |
oct | 5762641607243155 |
9 | 1016227475225108 |
10 | 210200231233133 |
11 | 60a81465693429 |
12 | 1b6aa268179ba5 |
13 | 9039a48607bbb |
14 | 39c9a61826ca1 |
15 | 1947bcc8d0008 |
hex | bf2d0e1d466d |
210200231233133 has 8 divisors (see below), whose sum is σ = 212243092466496. Its totient is φ = 208157410044000.
The previous prime is 210200231233123. The next prime is 210200231233169. The reversal of 210200231233133 is 331332132002012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 210200231233133 - 210 = 210200231232109 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210200231233123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 592673 + ... + 20512233.
It is an arithmetic number, because the mean of its divisors is an integer number (26530386558312).
Almost surely, 2210200231233133 is an apocalyptic number.
It is an amenable number.
210200231233133 is a deficient number, since it is larger than the sum of its proper divisors (2042861233363).
210200231233133 is a wasteful number, since it uses less digits than its factorization.
210200231233133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20022115.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 210200231233133 its reverse (331332132002012), we get a palindrome (541532363235145).
The spelling of 210200231233133 in words is "two hundred ten trillion, two hundred billion, two hundred thirty-one million, two hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •