Base | Representation |
---|---|
bin | 1110001010110111001… |
… | …1100011010111001101 |
3 | 212021100100021200000020 |
4 | 3202231303203113031 |
5 | 12442023120004013 |
6 | 303455422252353 |
7 | 23405345026041 |
oct | 3425563432715 |
9 | 767310250006 |
10 | 243434141133 |
11 | 94270254307 |
12 | 3b2197270b9 |
13 | 19c569bc3c1 |
14 | bad47c6021 |
15 | 64eb6a9623 |
hex | 38adce35cd |
243434141133 has 8 divisors (see below), whose sum is σ = 324823456128. Its totient is φ = 162167126784.
The previous prime is 243434141101. The next prime is 243434141183. The reversal of 243434141133 is 331141434342.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 243434141133 - 25 = 243434141101 is a prime.
It is a super-2 number, since 2×2434341411332 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 243434141094 and 243434141103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243434141183) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30570516 + ... + 30578477.
It is an arithmetic number, because the mean of its divisors is an integer number (40602932016).
Almost surely, 2243434141133 is an apocalyptic number.
It is an amenable number.
243434141133 is a deficient number, since it is larger than the sum of its proper divisors (81389314995).
243434141133 is a wasteful number, since it uses less digits than its factorization.
243434141133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61150323.
The product of its digits is 41472, while the sum is 33.
Adding to 243434141133 its reverse (331141434342), we get a palindrome (574575575475).
The spelling of 243434141133 in words is "two hundred forty-three billion, four hundred thirty-four million, one hundred forty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •