Base | Representation |
---|---|
bin | 101101100001010011000101… |
… | …101011001001000101011011 |
3 | 222020211222001100200012202220 |
4 | 231201103011223021011123 |
5 | 202220040234444201412 |
6 | 1545442432435555123 |
7 | 60111665600361144 |
oct | 5541230553110533 |
9 | 866758040605686 |
10 | 200200332022107 |
11 | 5887653623a68a |
12 | 1a5541ba15baa3 |
13 | 8792a6c30b331 |
14 | 3761a67c52acb |
15 | 1822a0b74a68c |
hex | b614c5ac915b |
200200332022107 has 4 divisors (see below), whose sum is σ = 266933776029480. Its totient is φ = 133466888014736.
The previous prime is 200200332021971. The next prime is 200200332022111. The reversal of 200200332022107 is 701220233002002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200200332022107 - 234 = 200183152152923 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200200332020107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33366722003682 + ... + 33366722003687.
It is an arithmetic number, because the mean of its divisors is an integer number (66733444007370).
Almost surely, 2200200332022107 is an apocalyptic number.
200200332022107 is a deficient number, since it is larger than the sum of its proper divisors (66733444007373).
200200332022107 is an equidigital number, since it uses as much as digits as its factorization.
200200332022107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66733444007372.
The product of its (nonzero) digits is 2016, while the sum is 24.
Adding to 200200332022107 its reverse (701220233002002), we get a palindrome (901420565024109).
The spelling of 200200332022107 in words is "two hundred trillion, two hundred billion, three hundred thirty-two million, twenty-two thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •