Base | Representation |
---|---|
bin | 100100011111111101100011… |
… | …0111010001101101011001010 |
3 | 1120002202021200211012020120100 |
4 | 1020333323012322031223022 |
5 | 314040104241441301010 |
6 | 3054453152420110230 |
7 | 124424152245433512 |
oct | 11077730672155312 |
9 | 1502667624166510 |
10 | 321052142525130 |
11 | 9332a4a3709325 |
12 | 30012080b35376 |
13 | 10a1b119580c43 |
14 | 593d0141c6842 |
15 | 271b4829682c0 |
hex | 123fec6e8daca |
321052142525130 has 96 divisors (see below), whose sum is σ = 834935554252800. Its totient is φ = 85593396105216.
The previous prime is 321052142525117. The next prime is 321052142525141. The reversal of 321052142525130 is 31525241250123.
321052142525130 is a `hidden beast` number, since 3 + 2 + 1 + 0 + 52 + 1 + 42 + 52 + 513 + 0 = 666.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11944335031 + ... + 11944361909.
It is an arithmetic number, because the mean of its divisors is an integer number (8697245356800).
Almost surely, 2321052142525130 is an apocalyptic number.
321052142525130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
321052142525130 is an abundant number, since it is smaller than the sum of its proper divisors (513883411727670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321052142525130 is a wasteful number, since it uses less digits than its factorization.
321052142525130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53748 (or 53745 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
Adding to 321052142525130 its reverse (31525241250123), we get a palindrome (352577383775253).
The spelling of 321052142525130 in words is "three hundred twenty-one trillion, fifty-two billion, one hundred forty-two million, five hundred twenty-five thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •