Base | Representation |
---|---|
bin | 111110100111110… |
… | …0100010110010001 |
3 | 12102102211200211222 |
4 | 1331033210112101 |
5 | 13300403424131 |
6 | 544300414425 |
7 | 103033120565 |
oct | 17517442621 |
9 | 5372750758 |
10 | 2101233041 |
11 | 989100536 |
12 | 4a7847415 |
13 | 27643017b |
14 | 15d0cb6a5 |
15 | c470c87b |
hex | 7d3e4591 |
2101233041 has 4 divisors (see below), whose sum is σ = 2169014784. Its totient is φ = 2033451300.
The previous prime is 2101233037. The next prime is 2101233049. The reversal of 2101233041 is 1403321012.
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 2101233041 - 22 = 2101233037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2101233049) 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 3 ways as a sum of consecutive naturals, for example, 33890825 + ... + 33890886.
It is an arithmetic number, because the mean of its divisors is an integer number (542253696).
Almost surely, 22101233041 is an apocalyptic number.
It is an amenable number.
2101233041 is a deficient number, since it is larger than the sum of its proper divisors (67781743).
2101233041 is an equidigital number, since it uses as much as digits as its factorization.
2101233041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67781742.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2101233041 is about 45839.2085555586. The cubic root of 2101233041 is about 1280.8297519193.
Adding to 2101233041 its reverse (1403321012), we get a palindrome (3504554053).
The spelling of 2101233041 in words is "two billion, one hundred one million, two hundred thirty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •