Base | Representation |
---|---|
bin | 11101010011000011010… |
… | …011010110000111111000 |
3 | 21010110201211021011201102 |
4 | 131103003103112013320 |
5 | 230441240224314000 |
6 | 4140523531110532 |
7 | 265312656611321 |
oct | 35230323260770 |
9 | 7113654234642 |
10 | 2013321323000 |
11 | 706932443a39 |
12 | 2862412a2448 |
13 | 117b1738b510 |
14 | 6d633b7d448 |
15 | 375877513d5 |
hex | 1d4c34d61f8 |
2013321323000 has 64 divisors (see below), whose sum is σ = 5073569766720. Its totient is φ = 743380176000.
The previous prime is 2013321322997. The next prime is 2013321323009. The reversal of 2013321323000 is 3231233102.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013321323009) 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, 77422436 + ... + 77448435.
It is an arithmetic number, because the mean of its divisors is an integer number (79274527605).
Almost surely, 22013321323000 is an apocalyptic number.
2013321323000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2013321323000 is an abundant number, since it is smaller than the sum of its proper divisors (3060248443720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2013321323000 is a wasteful number, since it uses less digits than its factorization.
2013321323000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154870905 (or 154870891 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 2013321323000 its reverse (3231233102), we get a palindrome (2016552556102).
The spelling of 2013321323000 in words is "two trillion, thirteen billion, three hundred twenty-one million, three hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •