Base | Representation |
---|---|
bin | 1000010101000111… |
… | …1001011010011111 |
3 | 12202211112200111210 |
4 | 2011101321122133 |
5 | 14034412430333 |
6 | 1005514315503 |
7 | 106261131165 |
oct | 20521713237 |
9 | 5684480453 |
10 | 2236061343 |
11 | a4821aa8a |
12 | 524a28b93 |
13 | 298349529 |
14 | 172d87235 |
15 | d1491a63 |
hex | 8547969f |
2236061343 has 8 divisors (see below), whose sum is σ = 2984691456. Its totient is φ = 1489069400.
The previous prime is 2236061339. The next prime is 2236061351. The reversal of 2236061343 is 3431606322.
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 2236061343 - 22 = 2236061339 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2236061343.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2236061393) 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, 406353 + ... + 411818.
It is an arithmetic number, because the mean of its divisors is an integer number (373086432).
Almost surely, 22236061343 is an apocalyptic number.
2236061343 is a deficient number, since it is larger than the sum of its proper divisors (748630113).
2236061343 is an equidigital number, since it uses as much as digits as its factorization.
2236061343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 819085.
The product of its (nonzero) digits is 15552, while the sum is 30.
The square root of 2236061343 is about 47287.0102988125. The cubic root of 2236061343 is about 1307.6591927175.
Adding to 2236061343 its reverse (3431606322), we get a palindrome (5667667665).
The spelling of 2236061343 in words is "two billion, two hundred thirty-six million, sixty-one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •