Base | Representation |
---|---|
bin | 111110101001110… |
… | …1000110111100011 |
3 | 12102111211220121211 |
4 | 1331103220313203 |
5 | 13301142101011 |
6 | 544335330551 |
7 | 103045153621 |
oct | 17523506743 |
9 | 5374756554 |
10 | 2102300131 |
11 | 98976a228 |
12 | 4a8080a57 |
13 | 276714a99 |
14 | 15d2c8511 |
15 | c486db21 |
hex | 7d4e8de3 |
2102300131 has 4 divisors (see below), whose sum is σ = 2131910064. Its totient is φ = 2072690200.
The previous prime is 2102300129. The next prime is 2102300141. The reversal of 2102300131 is 1310032012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2102300131 - 21 = 2102300129 is a prime.
It is a super-2 number, since 2×21023001312 = 8839331681605234322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2102300141) 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, 14804860 + ... + 14805001.
It is an arithmetic number, because the mean of its divisors is an integer number (532977516).
Almost surely, 22102300131 is an apocalyptic number.
2102300131 is a deficient number, since it is larger than the sum of its proper divisors (29609933).
2102300131 is an equidigital number, since it uses as much as digits as its factorization.
2102300131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29609932.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 2102300131 is about 45850.8465679752. The cubic root of 2102300131 is about 1281.0465340489.
Adding to 2102300131 its reverse (1310032012), we get a palindrome (3412332143).
The spelling of 2102300131 in words is "two billion, one hundred two million, three hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •