Base | Representation |
---|---|
bin | 1011101001110011101… |
… | …1011110001000010110 |
3 | 201010202101010101000100 |
4 | 2322130323132020112 |
5 | 11240003020044342 |
6 | 231545441154530 |
7 | 20315114144334 |
oct | 2723473361026 |
9 | 633671111010 |
10 | 200201331222 |
11 | 779a5483342 |
12 | 3297302ba46 |
13 | 15b56c51389 |
14 | 9992b2cb54 |
15 | 531ae92e4c |
hex | 2e9cede216 |
200201331222 has 12 divisors (see below), whose sum is σ = 433769551020. Its totient is φ = 66733777068.
The previous prime is 200201331217. The next prime is 200201331241. The reversal of 200201331222 is 222133102002.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 11122296179 = 200201331222 / (2 + 0 + 0 + 2 + 0 + 1 + 3 + 3 + 1 + 2 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 200201331195 and 200201331204.
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, 5561148072 + ... + 5561148107.
It is an arithmetic number, because the mean of its divisors is an integer number (36147462585).
Almost surely, 2200201331222 is an apocalyptic number.
200201331222 is an abundant number, since it is smaller than the sum of its proper divisors (233568219798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200201331222 is a wasteful number, since it uses less digits than its factorization.
200201331222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11122296187 (or 11122296184 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 200201331222 its reverse (222133102002), we get a palindrome (422334433224).
The spelling of 200201331222 in words is "two hundred billion, two hundred one million, three hundred thirty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •