Base | Representation |
---|---|
bin | 1011101001101010010… |
… | …1011100010100110111 |
3 | 201010122122010020210001 |
4 | 2322122211130110313 |
5 | 11234412433032411 |
6 | 231541514212131 |
7 | 20314125642502 |
oct | 2723245342467 |
9 | 633578106701 |
10 | 200162002231 |
11 | 77985260944 |
12 | 32961a24047 |
13 | 15b4ba61099 |
14 | 998b812139 |
15 | 53177c4dc1 |
hex | 2e9a95c537 |
200162002231 has 8 divisors (see below), whose sum is σ = 203573244240. Its totient is φ = 196751382528.
The previous prime is 200162002223. The next prime is 200162002277. The reversal of 200162002231 is 132200261002.
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 200162002231 - 23 = 200162002223 is a prime.
It is a super-2 number, since 2×2001620022312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200162002199 and 200162002208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200162002331) 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, 517815 + ... + 817591.
It is an arithmetic number, because the mean of its divisors is an integer number (25446655530).
Almost surely, 2200162002231 is an apocalyptic number.
200162002231 is a deficient number, since it is larger than the sum of its proper divisors (3411242009).
200162002231 is a wasteful number, since it uses less digits than its factorization.
200162002231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311153.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 200162002231 its reverse (132200261002), we get a palindrome (332362263233).
The spelling of 200162002231 in words is "two hundred billion, one hundred sixty-two million, two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •