Base | Representation |
---|---|
bin | 101011110101101101101… |
… | …0111111101101000011111 |
3 | 210100000011021011002022020 |
4 | 1113223123113331220133 |
5 | 1242204130002003210 |
6 | 20451541110351223 |
7 | 1161210453265554 |
oct | 127533327755037 |
9 | 23300137132266 |
10 | 6025224641055 |
11 | 1a13313261644 |
12 | 81388b65b513 |
13 | 34923a29a2c9 |
14 | 16b89dd30a2b |
15 | a6ae3730770 |
hex | 57adb5fda1f |
6025224641055 has 8 divisors (see below), whose sum is σ = 9640359425712. Its totient is φ = 3213453141888.
The previous prime is 6025224641047. The next prime is 6025224641063. The reversal of 6025224641055 is 5501464225206.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (6025224641047) and next prime (6025224641063).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6025224641055 - 23 = 6025224641047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6025224640998 and 6025224641016.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 200840821354 + ... + 200840821383.
It is an arithmetic number, because the mean of its divisors is an integer number (1205044928214).
Almost surely, 26025224641055 is an apocalyptic number.
6025224641055 is a deficient number, since it is larger than the sum of its proper divisors (3615134784657).
6025224641055 is a wasteful number, since it uses less digits than its factorization.
6025224641055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401681642745.
The product of its (nonzero) digits is 576000, while the sum is 42.
The spelling of 6025224641055 in words is "six trillion, twenty-five billion, two hundred twenty-four million, six hundred forty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •