Base | Representation |
---|---|
bin | 1011000100000110100101… |
… | …00100100000111100111001 |
3 | 10012010221120101112222110002 |
4 | 11202003102210200330321 |
5 | 11142111301223131212 |
6 | 123425052514402345 |
7 | 5060541501635330 |
oct | 542032244407471 |
9 | 105127511488402 |
10 | 24330227552057 |
11 | 7830434190189 |
12 | 288b43bb903b5 |
13 | 107643b48613b |
14 | 60183705cd17 |
15 | 2c2d420c6ac2 |
hex | 1620d2920f39 |
24330227552057 has 8 divisors (see below), whose sum is σ = 27809652931200. Its totient is φ = 20851721819424.
The previous prime is 24330227552041. The next prime is 24330227552063. The reversal of 24330227552057 is 75025572203342.
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 24330227552057 - 24 = 24330227552041 is a prime.
It is not an unprimeable number, because it can be changed into a prime (24330227555057) 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 7 ways as a sum of consecutive naturals, for example, 229854932 + ... + 229960757.
It is an arithmetic number, because the mean of its divisors is an integer number (3476206616400).
Almost surely, 224330227552057 is an apocalyptic number.
It is an amenable number.
24330227552057 is a deficient number, since it is larger than the sum of its proper divisors (3479425379143).
24330227552057 is an equidigital number, since it uses as much as digits as its factorization.
24330227552057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 459823255.
The product of its (nonzero) digits is 3528000, while the sum is 47.
Adding to 24330227552057 its reverse (75025572203342), we get a palindrome (99355799755399).
The spelling of 24330227552057 in words is "twenty-four trillion, three hundred thirty billion, two hundred twenty-seven million, five hundred fifty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •