Base | Representation |
---|---|
bin | 11101011010011001010… |
… | …11110010011010000000 |
3 | 10120121112201110102001001 |
4 | 32231030223302122000 |
5 | 113024204042033012 |
6 | 2052133124021344 |
7 | 133004464042351 |
oct | 16551453623200 |
9 | 3517481412031 |
10 | 1010603861632 |
11 | 35a65a596102 |
12 | 143a41231854 |
13 | 743b8104491 |
14 | 36cb0879d28 |
15 | 1b44c656357 |
hex | eb4caf2680 |
1010603861632 has 64 divisors (see below), whose sum is σ = 2125680530400. Its totient is φ = 477260467200.
The previous prime is 1010603861623. The next prime is 1010603861647. The reversal of 1010603861632 is 2361683060101.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 1010603861591 and 1010603861600.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 177282 + ... + 1432702.
Almost surely, 21010603861632 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 1010603861632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1062840265200).
1010603861632 is an abundant number, since it is smaller than the sum of its proper divisors (1115076668768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010603861632 is a wasteful number, since it uses less digits than its factorization.
1010603861632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1255785 (or 1255773 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 37.
The spelling of 1010603861632 in words is "one trillion, ten billion, six hundred three million, eight hundred sixty-one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •