Base | Representation |
---|---|
bin | 10011001110011101001… |
… | …011100010100101110000 |
3 | 11200022020010212000010010 |
4 | 103032131023202211300 |
5 | 133121300123224143 |
6 | 2450540333534520 |
7 | 164311240526403 |
oct | 23163513424560 |
9 | 4608203760103 |
10 | 1321192008048 |
11 | 46a350499530 |
12 | 194080644440 |
13 | 97784728983 |
14 | 47d35cbdd3a |
15 | 2457964da33 |
hex | 1339d2e2970 |
1321192008048 has 320 divisors, whose sum is σ = 4043693187072. Its totient is φ = 367169187840.
The previous prime is 1321192008043. The next prime is 1321192008089. The reversal of 1321192008048 is 8408002911231.
It is a junction number, because it is equal to n+sod(n) for n = 1321192007997 and 1321192008015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1321192008043) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 170979961 + ... + 170987687.
Almost surely, 21321192008048 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 1321192008048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2021846593536).
1321192008048 is an abundant number, since it is smaller than the sum of its proper divisors (2722501179024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1321192008048 is a wasteful number, since it uses less digits than its factorization.
1321192008048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8252 (or 8246 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 39.
Adding to 1321192008048 its reverse (8408002911231), we get a palindrome (9729194919279).
The spelling of 1321192008048 in words is "one trillion, three hundred twenty-one billion, one hundred ninety-two million, eight thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •