Base | Representation |
---|---|
bin | 10010110110011010… |
… | …01110111010100101 |
3 | 222010021210212210112 |
4 | 21123031032322211 |
5 | 131211223131323 |
6 | 4352113302405 |
7 | 505533454544 |
oct | 113315167245 |
9 | 28107725715 |
10 | 10120130213 |
11 | 4323605686 |
12 | 1b65264a05 |
13 | c5385b73b |
14 | 6c00b415b |
15 | 3e36dc178 |
hex | 25b34eea5 |
10120130213 has 4 divisors (see below), whose sum is σ = 10188050700. Its totient is φ = 10052209728.
The previous prime is 10120130197. The next prime is 10120130231. The reversal of 10120130213 is 31203102101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4329376804 + 5790753409 = 65798^2 + 76097^2 .
It is a cyclic number.
It is not a de Polignac number, because 10120130213 - 24 = 10120130197 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 (10120130263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33960020 + ... + 33960317.
It is an arithmetic number, because the mean of its divisors is an integer number (2547012675).
Almost surely, 210120130213 is an apocalyptic number.
It is an amenable number.
10120130213 is a deficient number, since it is larger than the sum of its proper divisors (67920487).
10120130213 is an equidigital number, since it uses as much as digits as its factorization.
10120130213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67920486.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 10120130213 its reverse (31203102101), we get a palindrome (41323232314).
The spelling of 10120130213 in words is "ten billion, one hundred twenty million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •