Base | Representation |
---|---|
bin | 10010101010011… |
… | …011110000000101 |
3 | 210211011211010012 |
4 | 102222123300011 |
5 | 1120124113410 |
6 | 51023040005 |
7 | 10521264440 |
oct | 2252336005 |
9 | 724154105 |
10 | 313113605 |
11 | 150820982 |
12 | 88a40005 |
13 | 4cb3c92c |
14 | 2d828657 |
15 | 1c74e605 |
hex | 12a9bc05 |
313113605 has 16 divisors (see below), whose sum is σ = 448084224. Its totient is φ = 205370880.
The previous prime is 313113601. The next prime is 313113613. The reversal of 313113605 is 506311313.
It is a happy number.
It is not a de Polignac number, because 313113605 - 22 = 313113601 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313113601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 193676 + ... + 195285.
It is an arithmetic number, because the mean of its divisors is an integer number (28005264).
Almost surely, 2313113605 is an apocalyptic number.
313113605 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
313113605 is a deficient number, since it is larger than the sum of its proper divisors (134970619).
313113605 is a wasteful number, since it uses less digits than its factorization.
313113605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388996.
The product of its (nonzero) digits is 810, while the sum is 23.
The square root of 313113605 is about 17695.0163888028. The cubic root of 313113605 is about 679.0482684866.
Adding to 313113605 its reverse (506311313), we get a palindrome (819424918).
The spelling of 313113605 in words is "three hundred thirteen million, one hundred thirteen thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •