Base | Representation |
---|---|
bin | 111100100000011… |
… | …0000000111010101 |
3 | 12020111020212222222 |
4 | 1321000300013111 |
5 | 13124220141323 |
6 | 533243032125 |
7 | 101211520451 |
oct | 17100600725 |
9 | 5214225888 |
10 | 2030240213 |
11 | 952021581 |
12 | 487b0b645 |
13 | 264804791 |
14 | 1538cb661 |
15 | bd3879c8 |
hex | 790301d5 |
2030240213 has 8 divisors (see below), whose sum is σ = 2050577760. Its totient is φ = 2009934000.
The previous prime is 2030240203. The next prime is 2030240221. The reversal of 2030240213 is 3120420302.
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 2030240213 - 28 = 2030239957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2030240191 and 2030240200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2030240203) 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, 135338 + ... + 149588.
It is an arithmetic number, because the mean of its divisors is an integer number (256322220).
Almost surely, 22030240213 is an apocalyptic number.
It is an amenable number.
2030240213 is a deficient number, since it is larger than the sum of its proper divisors (20337547).
2030240213 is a wasteful number, since it uses less digits than its factorization.
2030240213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15667.
The product of its (nonzero) digits is 288, while the sum is 17.
The square root of 2030240213 is about 45058.1869697395. The cubic root of 2030240213 is about 1266.2393584113.
Adding to 2030240213 its reverse (3120420302), we get a palindrome (5150660515).
The spelling of 2030240213 in words is "two billion, thirty million, two hundred forty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •