Base | Representation |
---|---|
bin | 10010101010100… |
… | …010100100001010 |
3 | 210211020020101212 |
4 | 102222202210022 |
5 | 1120131012024 |
6 | 51023413122 |
7 | 10521442010 |
oct | 2252424412 |
9 | 724206355 |
10 | 313141514 |
11 | 15083a944 |
12 | 88a541a2 |
13 | 4cb4c54a |
14 | 2d8348b0 |
15 | 1c757a0e |
hex | 12aa290a |
313141514 has 8 divisors (see below), whose sum is σ = 536814048. Its totient is φ = 134203500.
The previous prime is 313141469. The next prime is 313141519. The reversal of 313141514 is 415141313.
It is a happy number.
313141514 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 313141514.
It is not an unprimeable number, because it can be changed into a prime (313141519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11183612 + ... + 11183639.
It is an arithmetic number, because the mean of its divisors is an integer number (67101756).
Almost surely, 2313141514 is an apocalyptic number.
313141514 is a deficient number, since it is larger than the sum of its proper divisors (223672534).
313141514 is a wasteful number, since it uses less digits than its factorization.
313141514 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22367260.
The product of its digits is 720, while the sum is 23.
The square root of 313141514 is about 17695.8049831026. The cubic root of 313141514 is about 679.0684432674.
Adding to 313141514 its reverse (415141313), we get a palindrome (728282827).
The spelling of 313141514 in words is "three hundred thirteen million, one hundred forty-one thousand, five hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •