Base | Representation |
---|---|
bin | 111100110101010… |
… | …0110010111001001 |
3 | 12021020220020010222 |
4 | 1321222212113021 |
5 | 13140022212223 |
6 | 534314115425 |
7 | 101404000322 |
oct | 17152462711 |
9 | 5236806128 |
10 | 2041210313 |
11 | 95823457a |
12 | 48b71bb75 |
13 | 266b75a6c |
14 | 155145449 |
15 | be3030c8 |
hex | 79aa65c9 |
2041210313 has 8 divisors (see below), whose sum is σ = 2046515328. Its totient is φ = 2035913824.
The previous prime is 2041210307. The next prime is 2041210321. The reversal of 2041210313 is 3130121402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2041210313 - 28 = 2041210057 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2041210291 and 2041210300.
It is not an unprimeable number, because it can be changed into a prime (2041210333) 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 7 ways as a sum of consecutive naturals, for example, 841220 + ... + 843642.
It is an arithmetic number, because the mean of its divisors is an integer number (255814416).
Almost surely, 22041210313 is an apocalyptic number.
It is an amenable number.
2041210313 is a deficient number, since it is larger than the sum of its proper divisors (5305015).
2041210313 is an equidigital number, since it uses as much as digits as its factorization.
2041210313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4263.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2041210313 is about 45179.7555659612. The cubic root of 2041210313 is about 1268.5159081229.
Adding to 2041210313 its reverse (3130121402), we get a palindrome (5171331715).
The spelling of 2041210313 in words is "two billion, forty-one million, two hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •