Base | Representation |
---|---|
bin | 10010101011101011… |
… | …11010010000100101 |
3 | 221220000110102000012 |
4 | 21111311322100211 |
5 | 131020203131323 |
6 | 4335140300005 |
7 | 503361462065 |
oct | 112565722045 |
9 | 27800412005 |
10 | 10030130213 |
11 | 4287824314 |
12 | 1b3b0a1605 |
13 | c3b0097bc |
14 | 6b21673a5 |
15 | 3da860678 |
hex | 255d7a425 |
10030130213 has 8 divisors (see below), whose sum is σ = 10257127200. Its totient is φ = 9805033168.
The previous prime is 10030130179. The next prime is 10030130219. The reversal of 10030130213 is 31203103001.
10030130213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10030130213 - 28 = 10030129957 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 (10030130219) 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, 464306 + ... + 485427.
It is an arithmetic number, because the mean of its divisors is an integer number (1282140900).
Almost surely, 210030130213 is an apocalyptic number.
It is an amenable number.
10030130213 is a deficient number, since it is larger than the sum of its proper divisors (226996987).
10030130213 is an equidigital number, since it uses as much as digits as its factorization.
10030130213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 949971.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 10030130213 its reverse (31203103001), we get a palindrome (41233233214).
The spelling of 10030130213 in words is "ten billion, thirty million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •