Base | Representation |
---|---|
bin | 100001110000111110100… |
… | …100001000110001000000 |
3 | 22012211011221000111210002 |
4 | 201300332210020301000 |
5 | 301004014443002240 |
6 | 4533540143255132 |
7 | 326431663403315 |
oct | 41607644106100 |
9 | 8184157014702 |
10 | 2320332000320 |
11 | 815057a17934 |
12 | 3158425aa4a8 |
13 | 13aa63790ca9 |
14 | 8043a01ad0c |
15 | 40555637d15 |
hex | 21c3e908c40 |
2320332000320 has 56 divisors (see below), whose sum is σ = 5525998908864. Its totient is φ = 928013815296.
The previous prime is 2320332000317. The next prime is 2320332000353. The reversal of 2320332000320 is 230002330232.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 2320332000292 and 2320332000301.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2056589 + ... + 2978291.
It is an arithmetic number, because the mean of its divisors is an integer number (98678551944).
Almost surely, 22320332000320 is an apocalyptic number.
2320332000320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2320332000320 is an abundant number, since it is smaller than the sum of its proper divisors (3205666908544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2320332000320 is an equidigital number, since it uses as much as digits as its factorization.
2320332000320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 929587 (or 929577 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 20.
Adding to 2320332000320 its reverse (230002330232), we get a palindrome (2550334330552).
The spelling of 2320332000320 in words is "two trillion, three hundred twenty billion, three hundred thirty-two million, three hundred twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •