Base | Representation |
---|---|
bin | 1110001010100011100… |
… | …0011101001011010011 |
3 | 212021010120212010011010 |
4 | 3202220320131023103 |
5 | 12441340443243220 |
6 | 303443312022003 |
7 | 23403322651503 |
oct | 3425070351323 |
9 | 767116763133 |
10 | 243351540435 |
11 | 94228667173 |
12 | 3b1b5b31903 |
13 | 19c4285b353 |
14 | bac7843a03 |
15 | 64e42e01e0 |
hex | 38a8e1d2d3 |
243351540435 has 64 divisors (see below), whose sum is σ = 398180966400. Its totient is φ = 126881986560.
The previous prime is 243351540433. The next prime is 243351540463. The reversal of 243351540435 is 534045153342.
243351540435 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 243351540435 - 21 = 243351540433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 243351540393 and 243351540402.
It is not an unprimeable number, because it can be changed into a prime (243351540433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 136944267 + ... + 136946043.
It is an arithmetic number, because the mean of its divisors is an integer number (6221577600).
Almost surely, 2243351540435 is an apocalyptic number.
243351540435 is a deficient number, since it is larger than the sum of its proper divisors (154829425965).
243351540435 is a wasteful number, since it uses less digits than its factorization.
243351540435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2868.
The product of its (nonzero) digits is 432000, while the sum is 39.
Adding to 243351540435 its reverse (534045153342), we get a palindrome (777396693777).
The spelling of 243351540435 in words is "two hundred forty-three billion, three hundred fifty-one million, five hundred forty thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •