Base | Representation |
---|---|
bin | 10011110011101110001… |
… | …000111111110110100000 |
3 | 11211010111201100200110110 |
4 | 103303232020333312200 |
5 | 134300221440023012 |
6 | 2521155015131320 |
7 | 200225633415360 |
oct | 23635610776640 |
9 | 4733451320413 |
10 | 1361205001632 |
11 | 485313811873 |
12 | 19b988973b40 |
13 | 9b4903aa538 |
14 | 49c500b09a0 |
15 | 2561c35073c |
hex | 13cee23fda0 |
1361205001632 has 48 divisors (see below), whose sum is σ = 4083615006912. Its totient is φ = 388915714560.
The previous prime is 1361205001609. The next prime is 1361205001711. The reversal of 1361205001632 is 2361005021631.
It is a tau number, because it is divible by the number of its divisors (48).
It is a self number, because there is not a number n which added to its sum of digits gives 1361205001632.
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 7 ways as a sum of consecutive naturals, for example, 1012800669 + ... + 1012802012.
It is an arithmetic number, because the mean of its divisors is an integer number (85075312644).
Almost surely, 21361205001632 is an apocalyptic number.
1361205001632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1361205001632 is an abundant number, since it is smaller than the sum of its proper divisors (2722410005280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1361205001632 is a wasteful number, since it uses less digits than its factorization.
1361205001632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2025602701 (or 2025602693 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 30.
The spelling of 1361205001632 in words is "one trillion, three hundred sixty-one billion, two hundred five million, one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •