Base | Representation |
---|---|
bin | 1101101110111101110010… |
… | …00100110011011010110000 |
3 | 10221221012010000111000021221 |
4 | 12313132321010303122300 |
5 | 12424303142121233240 |
6 | 144122053533354424 |
7 | 6234644301150364 |
oct | 667367104633260 |
9 | 127835100430257 |
10 | 30201020102320 |
11 | 96941a9566221 |
12 | 34791b0638a14 |
13 | 13b0c36bb6462 |
14 | 765a46b2d2a4 |
15 | 3758e7aa0a4a |
hex | 1b77b91336b0 |
30201020102320 has 20 divisors (see below), whose sum is σ = 70217371738080. Its totient is φ = 12080408040896.
The previous prime is 30201020102317. The next prime is 30201020102339. The reversal of 30201020102320 is 2320102010203.
It is a tau number, because it is divible by the number of its divisors (20).
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 30201020102294 and 30201020102303.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 188756375560 + ... + 188756375719.
It is an arithmetic number, because the mean of its divisors is an integer number (3510868586904).
Almost surely, 230201020102320 is an apocalyptic number.
It is an amenable number.
30201020102320 is an abundant number, since it is smaller than the sum of its proper divisors (40016351635760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30201020102320 is a wasteful number, since it uses less digits than its factorization.
30201020102320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 377512751292 (or 377512751286 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 30201020102320 its reverse (2320102010203), we get a palindrome (32521122112523).
The spelling of 30201020102320 in words is "thirty trillion, two hundred one billion, twenty million, one hundred two thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •