Base | Representation |
---|---|
bin | 111110100101101… |
… | …0111010010111010 |
3 | 12102100202201010201 |
4 | 1331023113102322 |
5 | 13300113143002 |
6 | 544221032414 |
7 | 103020550624 |
oct | 17513272272 |
9 | 5370681121 |
10 | 2100131002 |
11 | 988518562 |
12 | 4a73b570a |
13 | 276135688 |
14 | 15ccc1c14 |
15 | c4591087 |
hex | 7d2d74ba |
2100131002 has 8 divisors (see below), whose sum is σ = 3150393012. Its totient is φ = 1050000000.
The previous prime is 2100130969. The next prime is 2100131003. The reversal of 2100131002 is 2001310012.
It can be written as a sum of positive squares in 2 ways, for example, as 2097731601 + 2399401 = 45801^2 + 1549^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 2100131002.
It is not an unprimeable number, because it can be changed into a prime (2100131003) 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, 37252 + ... + 74752.
Almost surely, 22100131002 is an apocalyptic number.
2100131002 is a deficient number, since it is larger than the sum of its proper divisors (1050262010).
2100131002 is a wasteful number, since it uses less digits than its factorization.
2100131002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65504.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 2100131002 is about 45827.1862762706. The cubic root of 2100131002 is about 1280.6057927563.
Adding to 2100131002 its reverse (2001310012), we get a palindrome (4101441014).
It can be divided in two parts, 21001 and 31002, that added together give a triangular number (52003 = T322).
The spelling of 2100131002 in words is "two billion, one hundred million, one hundred thirty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •