Base | Representation |
---|---|
bin | 111111100000111… |
… | …1000100011011111 |
3 | 12111112020012002121 |
4 | 1333001320203133 |
5 | 13331041401343 |
6 | 551251003411 |
7 | 103545621505 |
oct | 17701704337 |
9 | 5445205077 |
10 | 2131200223 |
11 | 9a40092a9 |
12 | 4b5899567 |
13 | 27c6c3229 |
14 | 16308c675 |
15 | c717baed |
hex | 7f0788df |
2131200223 has 4 divisors (see below), whose sum is σ = 2256564960. Its totient is φ = 2005835488.
The previous prime is 2131200209. The next prime is 2131200229. The reversal of 2131200223 is 3220021312.
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 2131200223 - 25 = 2131200191 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2131200197 and 2131200206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2131200229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 62682343 + ... + 62682376.
It is an arithmetic number, because the mean of its divisors is an integer number (564141240).
Almost surely, 22131200223 is an apocalyptic number.
2131200223 is a deficient number, since it is larger than the sum of its proper divisors (125364737).
2131200223 is a wasteful number, since it uses less digits than its factorization.
2131200223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125364736.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 2131200223 is about 46164.9241632649. The cubic root of 2131200223 is about 1286.8899748510.
Adding to 2131200223 its reverse (3220021312), we get a palindrome (5351221535).
The spelling of 2131200223 in words is "two billion, one hundred thirty-one million, two hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •