Base | Representation |
---|---|
bin | 100001000110100010100… |
… | …110000000100100000000 |
3 | 22001110120022202010121210 |
4 | 201012202212000210000 |
5 | 244232204441303402 |
6 | 4501002440450120 |
7 | 323226545222460 |
oct | 41064246004400 |
9 | 8043508663553 |
10 | 2274765572352 |
11 | 7a77a49540a9 |
12 | 308a46479940 |
13 | 13668140a090 |
14 | 7c156463ba0 |
15 | 3e28a10e06c |
hex | 211a2980900 |
2274765572352 has 1152 divisors, whose sum is σ = 8218258800640. Its totient is φ = 541776936960.
The previous prime is 2274765572329. The next prime is 2274765572399. The reversal of 2274765572352 is 2532755674722.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a junction number, because it is equal to n+sod(n) for n = 2274765572292 and 2274765572301.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 3004973958 + ... + 3004974714.
Almost surely, 22274765572352 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2274765572352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4109129400320).
2274765572352 is an abundant number, since it is smaller than the sum of its proper divisors (5943493228288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2274765572352 is a wasteful number, since it uses less digits than its factorization.
2274765572352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 919 (or 905 counting only the distinct ones).
The product of its digits is 49392000, while the sum is 57.
The spelling of 2274765572352 in words is "two trillion, two hundred seventy-four billion, seven hundred sixty-five million, five hundred seventy-two thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •