Base | Representation |
---|---|
bin | 1001000111001100101… |
… | …01110110000001111000 |
3 | 1002221011121220021001002 |
4 | 10203212111312001320 |
5 | 20112213121200240 |
6 | 355500453144132 |
7 | 31422651130046 |
oct | 4434625660170 |
9 | 1087147807032 |
10 | 313102131320 |
11 | 110870a99500 |
12 | 5082132b048 |
13 | 236aa40c234 |
14 | 11223295396 |
15 | 8227a86d15 |
hex | 48e6576078 |
313102131320 has 96 divisors (see below), whose sum is σ = 776281408560. Its totient is φ = 113570688000.
The previous prime is 313102131311. The next prime is 313102131347. The reversal of 313102131320 is 23131201313.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 313102131292 and 313102131301.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1860179 + ... + 2021501.
Almost surely, 2313102131320 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 313102131320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (388140704280).
313102131320 is an abundant number, since it is smaller than the sum of its proper divisors (463179277240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
313102131320 is a wasteful number, since it uses less digits than its factorization.
313102131320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 161757 (or 161742 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 313102131320 its reverse (23131201313), we get a palindrome (336233332633).
The spelling of 313102131320 in words is "three hundred thirteen billion, one hundred two million, one hundred thirty-one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •