Base | Representation |
---|---|
bin | 100111000110011… |
… | …1011010000111000 |
3 | 10101102210002011212 |
4 | 1032030323100320 |
5 | 10141333330240 |
6 | 334104542252 |
7 | 44340624614 |
oct | 11614732070 |
9 | 3342702155 |
10 | 1312011320 |
11 | 613661584 |
12 | 307481988 |
13 | 17ba82179 |
14 | c636a344 |
15 | 7a2b4165 |
hex | 4e33b438 |
1312011320 has 64 divisors (see below), whose sum is σ = 3022034400. Its totient is φ = 512478720.
The previous prime is 1312011317. The next prime is 1312011341. The reversal of 1312011320 is 231102131.
It is a junction number, because it is equal to n+sod(n) for n = 1312011295 and 1312011304.
It is a congruent number.
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, 368750 + ... + 372290.
Almost surely, 21312011320 is an apocalyptic number.
1312011320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1312011320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1511017200).
1312011320 is an abundant number, since it is smaller than the sum of its proper divisors (1710023080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1312011320 is a wasteful number, since it uses less digits than its factorization.
1312011320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3768 (or 3764 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1312011320 is about 36221.6968128220. The cubic root of 1312011320 is about 1094.7438834428.
Adding to 1312011320 its reverse (231102131), we get a palindrome (1543113451).
The spelling of 1312011320 in words is "one billion, three hundred twelve million, eleven thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •