Base | Representation |
---|---|
bin | 1000101111001101… |
… | …1001010110100101 |
3 | 20001110111001122111 |
4 | 2023303121112211 |
5 | 14300422144323 |
6 | 1024424201021 |
7 | 112060321351 |
oct | 21363312645 |
9 | 6043431574 |
10 | 2345506213 |
11 | aa3a82596 |
12 | 555609171 |
13 | 2b4c18ccb |
14 | 183716461 |
15 | dadaec0d |
hex | 8bcd95a5 |
2345506213 has 8 divisors (see below), whose sum is σ = 2476974528. Its totient is φ = 2216495424.
The previous prime is 2345506193. The next prime is 2345506217. The reversal of 2345506213 is 3126055432.
It is a happy number.
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 2345506213 - 213 = 2345498021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2345506217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 612420 + ... + 616237.
It is an arithmetic number, because the mean of its divisors is an integer number (309621816).
Almost surely, 22345506213 is an apocalyptic number.
2345506213 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2345506213 is a deficient number, since it is larger than the sum of its proper divisors (131468315).
2345506213 is a wasteful number, since it uses less digits than its factorization.
2345506213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1228763.
The product of its (nonzero) digits is 21600, while the sum is 31.
The square root of 2345506213 is about 48430.4265209383. The cubic root of 2345506213 is about 1328.6549072736.
The spelling of 2345506213 in words is "two billion, three hundred forty-five million, five hundred six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •