Base | Representation |
---|---|
bin | 100001010001100001011… |
… | …010110110111001000000 |
3 | 22002121000002110100101111 |
4 | 201101201122312321000 |
5 | 244430332100011000 |
6 | 4510232500413104 |
7 | 324125005042033 |
oct | 41214132667100 |
9 | 8077002410344 |
10 | 2286557032000 |
11 | 8017a591a27a |
12 | 30b1973a7194 |
13 | 1378102b7237 |
14 | 7c9544b901a |
15 | 3e72a3d9cba |
hex | 214616b6e40 |
2286557032000 has 56 divisors (see below), whose sum is σ = 5662658509560. Its totient is φ = 914622809600.
The previous prime is 2286557031959. The next prime is 2286557032007. The reversal of 2286557032000 is 2307556822.
It can be written as a sum of positive squares in 4 ways, for example, as 64406318656 + 2222150713344 = 253784^2 + 1490688^2 .
It is a Harshad number since it is a multiple of its sum of digits (40).
It is not an unprimeable number, because it can be changed into a prime (2286557032007) 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 7 ways as a sum of consecutive naturals, for example, 142901815 + ... + 142917814.
Almost surely, 22286557032000 is an apocalyptic number.
2286557032000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2286557032000 is an abundant number, since it is smaller than the sum of its proper divisors (3376101477560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2286557032000 is an equidigital number, since it uses as much as digits as its factorization.
2286557032000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285819656 (or 285819636 counting only the distinct ones).
The product of its (nonzero) digits is 201600, while the sum is 40.
The spelling of 2286557032000 in words is "two trillion, two hundred eighty-six billion, five hundred fifty-seven million, thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •