Base | Representation |
---|---|
bin | 1110001001011100101… |
… | …0000000100101110101 |
3 | 212020100212021012222121 |
4 | 3202113022000211311 |
5 | 12440233330331203 |
6 | 303354005555541 |
7 | 23363052130126 |
oct | 3422712004565 |
9 | 766325235877 |
10 | 243054152053 |
11 | 94095806949 |
12 | 3b132415bb1 |
13 | 19bc60661ab |
14 | ba9a15004d |
15 | 64c814a0bd |
hex | 3897280975 |
243054152053 has 16 divisors (see below), whose sum is σ = 254030722560. Its totient is φ = 232252552000.
The previous prime is 243054152023. The next prime is 243054152083. The reversal of 243054152053 is 350251450342.
It is an interprime number because it is at equal distance from previous prime (243054152023) and next prime (243054152083).
It is a cyclic number.
It is not a de Polignac number, because 243054152053 - 29 = 243054151541 is a prime.
It is a super-2 number, since 2×2430541520532 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243054152023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7573026 + ... + 7605052.
It is an arithmetic number, because the mean of its divisors is an integer number (15876920160).
Almost surely, 2243054152053 is an apocalyptic number.
It is an amenable number.
243054152053 is a deficient number, since it is larger than the sum of its proper divisors (10976570507).
243054152053 is a wasteful number, since it uses less digits than its factorization.
243054152053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34748.
The product of its (nonzero) digits is 72000, while the sum is 34.
The spelling of 243054152053 in words is "two hundred forty-three billion, fifty-four million, one hundred fifty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •