Base | Representation |
---|---|
bin | 100100111111101000111… |
… | …001110101100001000100 |
3 | 100000000221121011202010021 |
4 | 210333220321311201010 |
5 | 313122443141204320 |
6 | 5223515155104524 |
7 | 351445623132256 |
oct | 44775071654104 |
9 | 10000847152107 |
10 | 2542233147460 |
11 | 8a0178377036 |
12 | 3508508a2144 |
13 | 155968300816 |
14 | 8b08aaa9cd6 |
15 | 461e16b0daa |
hex | 24fe8e75844 |
2542233147460 has 24 divisors (see below), whose sum is σ = 5338741889880. Its totient is φ = 1016883300864.
The previous prime is 2542233147431. The next prime is 2542233147479. The reversal of 2542233147460 is 647413322452.
2542233147460 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 411427313476 + 2130805833984 = 641426^2 + 1459728^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1678476 + ... + 2811004.
It is an arithmetic number, because the mean of its divisors is an integer number (222447578745).
Almost surely, 22542233147460 is an apocalyptic number.
2542233147460 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2542233147460 is an abundant number, since it is smaller than the sum of its proper divisors (2796508742420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2542233147460 is a wasteful number, since it uses less digits than its factorization.
2542233147460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1244775 (or 1244773 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 43.
The spelling of 2542233147460 in words is "two trillion, five hundred forty-two billion, two hundred thirty-three million, one hundred forty-seven thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •