Base | Representation |
---|---|
bin | 110110101100011110110011… |
… | …100001000001011110101111 |
3 | 1011112201110210212111212220102 |
4 | 312230132303201001132233 |
5 | 223012142422223004201 |
6 | 2211335414425541315 |
7 | 101445153046545263 |
oct | 6654366341013657 |
9 | 1145643725455812 |
10 | 240551245125551 |
11 | 6a713234796148 |
12 | 22b9053934483b |
13 | a42bb676a80b9 |
14 | 4358a5716c0a3 |
15 | 1cc245373526b |
hex | dac7b38417af |
240551245125551 has 8 divisors (see below), whose sum is σ = 243450222040704. Its totient is φ = 237652286523480.
The previous prime is 240551245125493. The next prime is 240551245125649. The reversal of 240551245125551 is 155521542155042.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 240551245125551 - 26 = 240551245125487 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 240551245125496 and 240551245125505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (240551245124551) 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, 22834070 + ... + 31662236.
It is an arithmetic number, because the mean of its divisors is an integer number (30431277755088).
Almost surely, 2240551245125551 is an apocalyptic number.
240551245125551 is a deficient number, since it is larger than the sum of its proper divisors (2898976915153).
240551245125551 is an equidigital number, since it uses as much as digits as its factorization.
240551245125551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9156541.
The product of its (nonzero) digits is 2000000, while the sum is 47.
The spelling of 240551245125551 in words is "two hundred forty trillion, five hundred fifty-one billion, two hundred forty-five million, one hundred twenty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •