Base | Representation |
---|---|
bin | 111100110101001… |
… | …1001011101111101 |
3 | 12021020210112200222 |
4 | 1321222121131331 |
5 | 13140014020001 |
6 | 534313031125 |
7 | 101403360335 |
oct | 17152313575 |
9 | 5236715628 |
10 | 2041157501 |
11 | 9581a8929 |
12 | 48b6b54a5 |
13 | 266b57a06 |
14 | 1551300c5 |
15 | be2e261b |
hex | 79a9977d |
2041157501 has 4 divisors (see below), whose sum is σ = 2084586432. Its totient is φ = 1997728572.
The previous prime is 2041157413. The next prime is 2041157507. The reversal of 2041157501 is 1057511402.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1057511402 = 2 ⋅528755701.
It is a cyclic number.
It is not a de Polignac number, because 2041157501 - 210 = 2041156477 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 (2041157507) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21714395 + ... + 21714488.
It is an arithmetic number, because the mean of its divisors is an integer number (521146608).
Almost surely, 22041157501 is an apocalyptic number.
It is an amenable number.
2041157501 is a deficient number, since it is larger than the sum of its proper divisors (43428931).
2041157501 is an equidigital number, since it uses as much as digits as its factorization.
2041157501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43428930.
The product of its (nonzero) digits is 1400, while the sum is 26.
The square root of 2041157501 is about 45179.1710968672. The cubic root of 2041157501 is about 1268.5049679731.
Adding to 2041157501 its reverse (1057511402), we get a palindrome (3098668903).
The spelling of 2041157501 in words is "two billion, forty-one million, one hundred fifty-seven thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.508 sec. • engine limits •