Base | Representation |
---|---|
bin | 1110001001010010001… |
… | …0011101011011110001 |
3 | 212020020210121202020221 |
4 | 3202110202131123301 |
5 | 12440141104330001 |
6 | 303345400333041 |
7 | 23362006605400 |
oct | 3422442353361 |
9 | 766223552227 |
10 | 243010230001 |
11 | 94072a37630 |
12 | 3b11b774181 |
13 | 19bb9c28406 |
14 | ba94399637 |
15 | 64c43711a1 |
hex | 389489d6f1 |
243010230001 has 12 divisors (see below), whose sum is σ = 308384040240. Its totient is φ = 189358620360.
The previous prime is 243010229983. The next prime is 243010230013. The reversal of 243010230001 is 100032010342.
It is a happy number.
243010230001 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 243010230001 - 27 = 243010229873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (243010230031) 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 11 ways as a sum of consecutive naturals, for example, 225426391 + ... + 225427468.
It is an arithmetic number, because the mean of its divisors is an integer number (25698670020).
Almost surely, 2243010230001 is an apocalyptic number.
It is an amenable number.
243010230001 is a deficient number, since it is larger than the sum of its proper divisors (65373810239).
243010230001 is a wasteful number, since it uses less digits than its factorization.
243010230001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450853884 (or 450853877 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 243010230001 its reverse (100032010342), we get a palindrome (343042240343).
The spelling of 243010230001 in words is "two hundred forty-three billion, ten million, two hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •