Base | Representation |
---|---|
bin | 10011010101011010001… |
… | …000010101111101000110 |
3 | 11201000111101121110110000 |
4 | 103111122020111331012 |
5 | 133232042144442412 |
6 | 2454213203142130 |
7 | 164664234264561 |
oct | 23253210257506 |
9 | 4630441543400 |
10 | 1328657030982 |
11 | 47253128a776 |
12 | 195604674946 |
13 | 983a418b4c8 |
14 | 484434c94d8 |
15 | 24864bc24dc |
hex | 1355a215f46 |
1328657030982 has 80 divisors (see below), whose sum is σ = 3065121702720. Its totient is φ = 429861416832.
The previous prime is 1328657030969. The next prime is 1328657030993. The reversal of 1328657030982 is 2890307568231.
1328657030982 is a `hidden beast` number, since 1 + 3 + 286 + 57 + 0 + 309 + 8 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2180563 + ... + 2722529.
It is an arithmetic number, because the mean of its divisors is an integer number (38314021284).
Almost surely, 21328657030982 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1328657030982, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1532560851360).
1328657030982 is an abundant number, since it is smaller than the sum of its proper divisors (1736464671738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1328657030982 is a wasteful number, since it uses less digits than its factorization.
1328657030982 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 542427 (or 542418 counting only the distinct ones).
The product of its (nonzero) digits is 4354560, while the sum is 54.
The spelling of 1328657030982 in words is "one trillion, three hundred twenty-eight billion, six hundred fifty-seven million, thirty thousand, nine hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •