Base | Representation |
---|---|
bin | 1000110001000011… |
… | …0000001101111001 |
3 | 20001222222001100011 |
4 | 2030100300031321 |
5 | 14304404431131 |
6 | 1025301141521 |
7 | 112212613231 |
oct | 21420601571 |
9 | 6058861304 |
10 | 2353202041 |
11 | aa8359583 |
12 | 5580ba8a1 |
13 | 2b66b1b58 |
14 | 18475acc1 |
15 | db8d00b1 |
hex | 8c430379 |
2353202041 has 4 divisors (see below), whose sum is σ = 2477054800. Its totient is φ = 2229349284.
The previous prime is 2353202023. The next prime is 2353202081. The reversal of 2353202041 is 1402023532.
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 2353202041 - 27 = 2353201913 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2353202021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 61926351 + ... + 61926388.
It is an arithmetic number, because the mean of its divisors is an integer number (619263700).
Almost surely, 22353202041 is an apocalyptic number.
It is an amenable number.
2353202041 is a deficient number, since it is larger than the sum of its proper divisors (123852759).
2353202041 is a wasteful number, since it uses less digits than its factorization.
2353202041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123852758.
The product of its (nonzero) digits is 1440, while the sum is 22.
The square root of 2353202041 is about 48509.8138627639. The cubic root of 2353202041 is about 1330.1064683834.
Adding to 2353202041 its reverse (1402023532), we get a palindrome (3755225573).
The spelling of 2353202041 in words is "two billion, three hundred fifty-three million, two hundred two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •