Base | Representation |
---|---|
bin | 11101010011000010101… |
… | …001011000000111101100 |
3 | 21010110201001120012222211 |
4 | 131103002221120013230 |
5 | 230441224420234012 |
6 | 4140522455220204 |
7 | 265312464240025 |
oct | 35230251300754 |
9 | 7113631505884 |
10 | 2013310321132 |
11 | 70692720a090 |
12 | 286239677664 |
13 | 117b15008936 |
14 | 6d632517c4c |
15 | 375867cb6a7 |
hex | 1d4c2a581ec |
2013310321132 has 24 divisors (see below), whose sum is σ = 3908738070720. Its totient is φ = 899630188560.
The previous prime is 2013310321111. The next prime is 2013310321151. The reversal of 2013310321132 is 2311230133102.
It is a super-2 number, since 2×20133103211322 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 387769038 + ... + 387774229.
It is an arithmetic number, because the mean of its divisors is an integer number (162864086280).
Almost surely, 22013310321132 is an apocalyptic number.
2013310321132 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2013310321132 is a deficient number, since it is larger than the sum of its proper divisors (1895427749588).
2013310321132 is a wasteful number, since it uses less digits than its factorization.
2013310321132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 775543341 (or 775543339 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 2013310321132 its reverse (2311230133102), we get a palindrome (4324540454234).
The spelling of 2013310321132 in words is "two trillion, thirteen billion, three hundred ten million, three hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •