Base | Representation |
---|---|
bin | 100000110101111011101… |
… | …010110001110010011110 |
3 | 21222202112111221102000000 |
4 | 200311323222301302132 |
5 | 243434144224020300 |
6 | 4444453123115130 |
7 | 322025615632650 |
oct | 40657352616236 |
9 | 7882474842000 |
10 | 2256932641950 |
11 | 7a0183702598 |
12 | 3054aa212aa6 |
13 | 134a9b9a405c |
14 | 7b343cc66d0 |
15 | 3da94757c00 |
hex | 20d7bab1c9e |
2256932641950 has 336 divisors, whose sum is σ = 7248116912256. Its totient is φ = 511924795200.
The previous prime is 2256932641939. The next prime is 2256932641967. The reversal of 2256932641950 is 591462396522.
2256932641950 is a `hidden beast` number, since 2 + 2 + 569 + 3 + 2 + 64 + 19 + 5 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 167 ways as a sum of consecutive naturals, for example, 33390889 + ... + 33458411.
Almost surely, 22256932641950 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2256932641950, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3624058456128).
2256932641950 is an abundant number, since it is smaller than the sum of its proper divisors (4991184270306).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2256932641950 is a wasteful number, since it uses less digits than its factorization.
2256932641950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67691 (or 67671 counting only the distinct ones).
The product of its (nonzero) digits is 6998400, while the sum is 54.
The spelling of 2256932641950 in words is "two trillion, two hundred fifty-six billion, nine hundred thirty-two million, six hundred forty-one thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •