Base | Representation |
---|---|
bin | 1000000001000110… |
… | …0100101001101111 |
3 | 12112222112111210022 |
4 | 2000101210221233 |
5 | 13401413341343 |
6 | 553314432355 |
7 | 104221315343 |
oct | 20021445157 |
9 | 5488474708 |
10 | 2152090223 |
11 | a04887268 |
12 | 5008926bb |
13 | 283b2878a |
14 | 165b69623 |
15 | c8e06568 |
hex | 80464a6f |
2152090223 has 8 divisors (see below), whose sum is σ = 2172849360. Its totient is φ = 2131349760.
The previous prime is 2152090211. The next prime is 2152090229. The reversal of 2152090223 is 3220902512.
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 2152090223 - 24 = 2152090207 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2152090192 and 2152090201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2152090229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 364511 + ... + 370367.
It is an arithmetic number, because the mean of its divisors is an integer number (271606170).
Almost surely, 22152090223 is an apocalyptic number.
2152090223 is a deficient number, since it is larger than the sum of its proper divisors (20759137).
2152090223 is a wasteful number, since it uses less digits than its factorization.
2152090223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9337.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 2152090223 is about 46390.6264562142. The cubic root of 2152090223 is about 1291.0810046205.
Adding to 2152090223 its reverse (3220902512), we get a palindrome (5372992735).
The spelling of 2152090223 in words is "two billion, one hundred fifty-two million, ninety thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •