Base | Representation |
---|---|
bin | 1110001001101100101… |
… | …0001010001111000111 |
3 | 212020112112121201020021 |
4 | 3202123022022033013 |
5 | 12440403023103143 |
6 | 303404405120011 |
7 | 23364525646021 |
oct | 3423312121707 |
9 | 766475551207 |
10 | 243121300423 |
11 | 9411a6aa471 |
12 | 3b1509b9007 |
13 | 19c06c46a61 |
14 | baa502d011 |
15 | 64cdeb0ced |
hex | 389b28a3c7 |
243121300423 has 16 divisors (see below), whose sum is σ = 258816769120. Its totient is φ = 227720595456.
The previous prime is 243121300421. The next prime is 243121300441. The reversal of 243121300423 is 324003121342.
243121300423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 243121300423 - 21 = 243121300421 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243121300421) 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 15 ways as a sum of consecutive naturals, for example, 1771315 + ... + 1903627.
It is an arithmetic number, because the mean of its divisors is an integer number (16176048070).
Almost surely, 2243121300423 is an apocalyptic number.
243121300423 is a deficient number, since it is larger than the sum of its proper divisors (15695468697).
243121300423 is a wasteful number, since it uses less digits than its factorization.
243121300423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133426.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 243121300423 its reverse (324003121342), we get a palindrome (567124421765).
The spelling of 243121300423 in words is "two hundred forty-three billion, one hundred twenty-one million, three hundred thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •