Base | Representation |
---|---|
bin | 11101000111101100011… |
… | …01100001100000100000 |
3 | 10112122121222002120001220 |
4 | 32203312031201200200 |
5 | 112343123131343203 |
6 | 2043352524455040 |
7 | 132200613321213 |
oct | 16436615414040 |
9 | 3478558076056 |
10 | 1000563152928 |
11 | 3563778a7039 |
12 | 141aba6aa480 |
13 | 73477b62a21 |
14 | 365db15b77a |
15 | 1b060e06653 |
hex | e8f6361820 |
1000563152928 has 48 divisors (see below), whose sum is σ = 2651024829600. Its totient is φ = 330404028416.
The previous prime is 1000563152873. The next prime is 1000563152933. The reversal of 1000563152928 is 8292513650001.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×10005631529282 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1000563152928.
It is an unprimeable number.
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, 48693153 + ... + 48713696.
It is an arithmetic number, because the mean of its divisors is an integer number (55229683950).
Almost surely, 21000563152928 is an apocalyptic number.
It is an amenable number.
1000563152928 is an abundant number, since it is smaller than the sum of its proper divisors (1650461676672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000563152928 is a wasteful number, since it uses less digits than its factorization.
1000563152928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97406969 (or 97406961 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 42.
The spelling of 1000563152928 in words is "one trillion, five hundred sixty-three million, one hundred fifty-two thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •