Base | Representation |
---|---|
bin | 11110110000001011111… |
… | …001001001101101101000 |
3 | 21111000212010220010022120 |
4 | 132300023321021231220 |
5 | 234111041300103000 |
6 | 4254503011351240 |
7 | 305453060600622 |
oct | 36601371115550 |
9 | 7430763803276 |
10 | 2113323441000 |
11 | 745289a96352 |
12 | 2a16ab8b2520 |
13 | 12439345ccc5 |
14 | 743dd1d1c12 |
15 | 39e8bc586a0 |
hex | 1ec0be49b68 |
2113323441000 has 64 divisors (see below), whose sum is σ = 6593569145280. Its totient is φ = 563552916800.
The previous prime is 2113323440959. The next prime is 2113323441023. The reversal of 2113323441000 is 1443233112.
It is a happy number.
It is a super-2 number, since 2×21133234410002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 352217574 + ... + 352223573.
It is an arithmetic number, because the mean of its divisors is an integer number (103024517895).
Almost surely, 22113323441000 is an apocalyptic number.
2113323441000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2113323441000 is an abundant number, since it is smaller than the sum of its proper divisors (4480245704280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2113323441000 is a wasteful number, since it uses less digits than its factorization.
2113323441000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 704441171 (or 704441157 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 2113323441000 its reverse (1443233112), we get a palindrome (2114766674112).
The spelling of 2113323441000 in words is "two trillion, one hundred thirteen billion, three hundred twenty-three million, four hundred forty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •