Base | Representation |
---|---|
bin | 1110001001101100101… |
… | …0100101101110011111 |
3 | 212020112112211102200122 |
4 | 3202123022211232133 |
5 | 12440403040204043 |
6 | 303404411345155 |
7 | 23364526625216 |
oct | 3423312455637 |
9 | 766475742618 |
10 | 243121413023 |
11 | 9411a777025 |
12 | 3b150a521bb |
13 | 19c06c86098 |
14 | baa505c07d |
15 | 64cded4368 |
hex | 389b2a5b9f |
243121413023 has 4 divisors (see below), whose sum is σ = 243131666160. Its totient is φ = 243111159888.
The previous prime is 243121412969. The next prime is 243121413071. The reversal of 243121413023 is 320314121342.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320314121342 = 2 ⋅160157060671.
It is a cyclic number.
It is not a de Polignac number, because 243121413023 - 26 = 243121412959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 243121412983 and 243121413001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243121413323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5090918 + ... + 5138451.
It is an arithmetic number, because the mean of its divisors is an integer number (60782916540).
Almost surely, 2243121413023 is an apocalyptic number.
243121413023 is a deficient number, since it is larger than the sum of its proper divisors (10253137).
243121413023 is a wasteful number, since it uses less digits than its factorization.
243121413023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10253136.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 243121413023 its reverse (320314121342), we get a palindrome (563435534365).
The spelling of 243121413023 in words is "two hundred forty-three billion, one hundred twenty-one million, four hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •