Base | Representation |
---|---|
bin | 1000100100110111… |
… | …1011100000100101 |
3 | 12221102212022221222 |
4 | 2021031323200211 |
5 | 14203321131323 |
6 | 1020234350125 |
7 | 111022532615 |
oct | 21115734045 |
9 | 5842768858 |
10 | 2302130213 |
11 | a81546559 |
12 | 542b8b345 |
13 | 2a8c3c936 |
14 | 17ba64a45 |
15 | d71929c8 |
hex | 8937b825 |
2302130213 has 4 divisors (see below), whose sum is σ = 2302665120. Its totient is φ = 2301595308.
The previous prime is 2302130209. The next prime is 2302130219. The reversal of 2302130213 is 3120312032.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2302130213 - 22 = 2302130209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2302130191 and 2302130200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2302130219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 260945 + ... + 269622.
It is an arithmetic number, because the mean of its divisors is an integer number (575666280).
Almost surely, 22302130213 is an apocalyptic number.
It is an amenable number.
2302130213 is a deficient number, since it is larger than the sum of its proper divisors (534907).
2302130213 is an equidigital number, since it uses as much as digits as its factorization.
2302130213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 534906.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 2302130213 is about 47980.5190989010. The cubic root of 2302130213 is about 1320.4135169468.
Adding to 2302130213 its reverse (3120312032), we get a palindrome (5422442245).
The spelling of 2302130213 in words is "two billion, three hundred two million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •