Base | Representation |
---|---|
bin | 1110001001010111010… |
… | …1100000011000000001 |
3 | 212020022022120210002020 |
4 | 3202111311200120001 |
5 | 12440212143000001 |
6 | 303351455112053 |
7 | 23362362625650 |
oct | 3422565403001 |
9 | 766268523066 |
10 | 243032000001 |
11 | 9408425676a |
12 | 3b126b12629 |
13 | 19bc15ab37b |
14 | ba97225197 |
15 | 64c6221736 |
hex | 3895d60601 |
243032000001 has 8 divisors (see below), whose sum is σ = 370334476224. Its totient is φ = 138875428560.
The previous prime is 243031999993. The next prime is 243032000009. The reversal of 243032000001 is 100000230342.
It is an interprime number because it is at equal distance from previous prime (243031999993) and next prime (243032000009).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 243032000001 - 23 = 243031999993 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (243032000009) 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, 5786476170 + ... + 5786476211.
It is an arithmetic number, because the mean of its divisors is an integer number (46291809528).
Almost surely, 2243032000001 is an apocalyptic number.
243032000001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
243032000001 is a deficient number, since it is larger than the sum of its proper divisors (127302476223).
243032000001 is a wasteful number, since it uses less digits than its factorization.
243032000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11572952391.
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 243032000001 its reverse (100000230342), we get a palindrome (343032230343).
The spelling of 243032000001 in words is "two hundred forty-three billion, thirty-two million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •