Base | Representation |
---|---|
bin | 111100100010100… |
… | …1110101111100001 |
3 | 12020120110112110111 |
4 | 1321011032233201 |
5 | 13130020223431 |
6 | 533324131321 |
7 | 101224510333 |
oct | 17105165741 |
9 | 5216415414 |
10 | 2031414241 |
11 | 95275364a |
12 | 488396b41 |
13 | 264b25c7c |
14 | 153b15453 |
15 | bd51a7b1 |
hex | 7914ebe1 |
2031414241 has 4 divisors (see below), whose sum is σ = 2138330800. Its totient is φ = 1924497684.
The previous prime is 2031414227. The next prime is 2031414277. The reversal of 2031414241 is 1424141302.
It is a happy number.
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 2031414241 - 223 = 2023025633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2031414641) 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, 53458251 + ... + 53458288.
It is an arithmetic number, because the mean of its divisors is an integer number (534582700).
Almost surely, 22031414241 is an apocalyptic number.
It is an amenable number.
2031414241 is a deficient number, since it is larger than the sum of its proper divisors (106916559).
2031414241 is a wasteful number, since it uses less digits than its factorization.
2031414241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106916558.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 2031414241 is about 45071.2129967677. The cubic root of 2031414241 is about 1266.4833876632.
Adding to 2031414241 its reverse (1424141302), we get a palindrome (3455555543).
The spelling of 2031414241 in words is "two billion, thirty-one million, four hundred fourteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •