Base | Representation |
---|---|
bin | 10010101010011… |
… | …000011101100001 |
3 | 210211011010122002 |
4 | 102222120131201 |
5 | 1120123201004 |
6 | 51022453345 |
7 | 10521210236 |
oct | 2252303541 |
9 | 724133562 |
10 | 313100129 |
11 | 150811841 |
12 | 88a34255 |
13 | 4cb36764 |
14 | 2d82378d |
15 | 1c74a61e |
hex | 12a98761 |
313100129 has 8 divisors (see below), whose sum is σ = 319432680. Its totient is φ = 306806400.
The previous prime is 313100119. The next prime is 313100143. The reversal of 313100129 is 921001313.
It can be written as a sum of positive squares in 4 ways, for example, as 37540129 + 275560000 = 6127^2 + 16600^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 313100129 - 24 = 313100113 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 313100129.
It is not an unprimeable number, because it can be changed into a prime (313100119) 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 7 ways as a sum of consecutive naturals, for example, 6869 + ... + 25949.
It is an arithmetic number, because the mean of its divisors is an integer number (39929085).
Almost surely, 2313100129 is an apocalyptic number.
It is an amenable number.
313100129 is a deficient number, since it is larger than the sum of its proper divisors (6332551).
313100129 is a wasteful number, since it uses less digits than its factorization.
313100129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19411.
The product of its (nonzero) digits is 162, while the sum is 20.
The square root of 313100129 is about 17694.6355995256. The cubic root of 313100129 is about 679.0385265637.
The spelling of 313100129 in words is "three hundred thirteen million, one hundred thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •