Base | Representation |
---|---|
bin | 111110100101101… |
… | …0100101011101101 |
3 | 12102100202011110101 |
4 | 1331023110223231 |
5 | 13300112322201 |
6 | 544220511101 |
7 | 103020504466 |
oct | 17513245355 |
9 | 5370664411 |
10 | 2100120301 |
11 | 988510514 |
12 | 4a73ab491 |
13 | 276130846 |
14 | 15ccbbd6d |
15 | c458cd01 |
hex | 7d2d4aed |
2100120301 has 4 divisors (see below), whose sum is σ = 2148960352. Its totient is φ = 2051280252.
The previous prime is 2100120287. The next prime is 2100120329. The reversal of 2100120301 is 1030210012.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2100120301 - 211 = 2100118253 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 (2100120361) 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, 24419961 + ... + 24420046.
It is an arithmetic number, because the mean of its divisors is an integer number (537240088).
Almost surely, 22100120301 is an apocalyptic number.
It is an amenable number.
2100120301 is a deficient number, since it is larger than the sum of its proper divisors (48840051).
2100120301 is an equidigital number, since it uses as much as digits as its factorization.
2100120301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48840050.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 2100120301 is about 45827.0695222813. The cubic root of 2100120301 is about 1280.6036176879.
Adding to 2100120301 its reverse (1030210012), we get a palindrome (3130330313).
The spelling of 2100120301 in words is "two billion, one hundred million, one hundred twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •