Base | Representation |
---|---|
bin | 100001110000101100000… |
… | …010010001011011001000 |
3 | 22012210101021001210222122 |
4 | 201300230002101123020 |
5 | 301002400402224000 |
6 | 4533445240310412 |
7 | 326421200152514 |
oct | 41605402213310 |
9 | 8183337053878 |
10 | 2320021133000 |
11 | 814a084a069a |
12 | 315776472408 |
13 | 13aa1425992c |
14 | 8040aa19144 |
15 | 405381ce085 |
hex | 21c2c0916c8 |
2320021133000 has 64 divisors (see below), whose sum is σ = 5435874353520. Its totient is φ = 926807616000.
The previous prime is 2320021132993. The next prime is 2320021133009. The reversal of 2320021133000 is 3311200232.
It can be written as a sum of positive squares in 8 ways, for example, as 437214533284 + 1882806599716 = 661222^2 + 1372154^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 2320021133000.
It is not an unprimeable number, because it can be changed into a prime (2320021133009) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 727661 + ... + 2273660.
Almost surely, 22320021133000 is an apocalyptic number.
2320021133000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2320021133000 is an abundant number, since it is smaller than the sum of its proper divisors (3115853220520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2320021133000 is a wasteful number, since it uses less digits than its factorization.
2320021133000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3002115 (or 3002101 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 2320021133000 its reverse (3311200232), we get a palindrome (2323332333232).
The spelling of 2320021133000 in words is "two trillion, three hundred twenty billion, twenty-one million, one hundred thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •