Base | Representation |
---|---|
bin | 1110000001010110101010… |
… | …10110010111100011001000 |
3 | 11001011120222122200012222220 |
4 | 13000223111112113203020 |
5 | 13020131141243130240 |
6 | 145324230133014040 |
7 | 6331412611245645 |
oct | 700532526274310 |
9 | 131146878605886 |
10 | 30832854661320 |
11 | 990815a711108 |
12 | 355b744784320 |
13 | 14286ab008c0a |
14 | 788464d2cdcc |
15 | 38707762a5d0 |
hex | 1c0ad55978c8 |
30832854661320 has 256 divisors, whose sum is σ = 98401311129600. Its totient is φ = 7706935434240.
The previous prime is 30832854661319. The next prime is 30832854661331. The reversal of 30832854661320 is 2316645823803.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 106123450 + ... + 106413590.
It is an arithmetic number, because the mean of its divisors is an integer number (384380121600).
Almost surely, 230832854661320 is an apocalyptic number.
30832854661320 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30832854661320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49200655564800).
30832854661320 is an abundant number, since it is smaller than the sum of its proper divisors (67568456468280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30832854661320 is a wasteful number, since it uses less digits than its factorization.
30832854661320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290668 (or 290664 counting only the distinct ones).
The product of its (nonzero) digits is 4976640, while the sum is 51.
The spelling of 30832854661320 in words is "thirty trillion, eight hundred thirty-two billion, eight hundred fifty-four million, six hundred sixty-one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •