Base | Representation |
---|---|
bin | 1001000111000001101… |
… | …11101001101000010010 |
3 | 1002220221020011021111000 |
4 | 10203200313221220102 |
5 | 20112021121031010 |
6 | 355443413402430 |
7 | 31420454623101 |
oct | 4434067515022 |
9 | 1086836137430 |
10 | 313010330130 |
11 | 110824197953 |
12 | 507b6639416 |
13 | 236943a94c4 |
14 | 11214dda038 |
15 | 821e9a17c0 |
hex | 48e0de9a12 |
313010330130 has 64 divisors (see below), whose sum is σ = 837019526400. Its totient is φ = 83236890240.
The previous prime is 313010330077. The next prime is 313010330141. The reversal of 313010330130 is 31033010313.
313010330130 is a `hidden beast` number, since 3 + 1 + 301 + 0 + 330 + 1 + 30 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
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 31 ways as a sum of consecutive naturals, for example, 1517691 + ... + 1711550.
It is an arithmetic number, because the mean of its divisors is an integer number (13078430100).
Almost surely, 2313010330130 is an apocalyptic number.
313010330130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
313010330130 is an abundant number, since it is smaller than the sum of its proper divisors (524009196270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
313010330130 is a wasteful number, since it uses less digits than its factorization.
313010330130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3229616 (or 3229610 counting only the distinct ones).
The product of its (nonzero) digits is 243, while the sum is 18.
Adding to 313010330130 its reverse (31033010313), we get a palindrome (344043340443).
The spelling of 313010330130 in words is "three hundred thirteen billion, ten million, three hundred thirty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •