Base | Representation |
---|---|
bin | 1001000111011000011… |
… | …11110011001100000000 |
3 | 1002221102112022222120222 |
4 | 10203230033303030000 |
5 | 20112414002210422 |
6 | 355514352522212 |
7 | 31425263234360 |
oct | 4435417631400 |
9 | 1087375288528 |
10 | 313201210112 |
11 | 110911a108aa |
12 | 5084a550368 |
13 | 236c4abc63b |
14 | 112324c69a0 |
15 | 8231608842 |
hex | 48ec3f3300 |
313201210112 has 108 divisors (see below), whose sum is σ = 739980988656. Its totient is φ = 129599877120.
The previous prime is 313201210103. The next prime is 313201210129. The reversal of 313201210112 is 211012102313.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1403162 + ... + 1610982.
Almost surely, 2313201210112 is an apocalyptic number.
313201210112 is a gapful number since it is divisible by the number (32) 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 313201210112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (369990494328).
313201210112 is an abundant number, since it is smaller than the sum of its proper divisors (426779778544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
313201210112 is an equidigital number, since it uses as much as digits as its factorization.
313201210112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207902 (or 207859 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 313201210112 its reverse (211012102313), we get a palindrome (524213312425).
The spelling of 313201210112 in words is "three hundred thirteen billion, two hundred one million, two hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •