Base | Representation |
---|---|
bin | 1001001001000111010… |
… | …10110101001110101001 |
3 | 1010000211022222101212000 |
4 | 10210203222311032221 |
5 | 20121320021340431 |
6 | 400150530241213 |
7 | 31460313545211 |
oct | 4444352651651 |
9 | 1100738871760 |
10 | 314131043241 |
11 | 11124986a234 |
12 | 50a69a26209 |
13 | 23812630062 |
14 | 112bdbab241 |
15 | 82880799e6 |
hex | 4923ab53a9 |
314131043241 has 32 divisors (see below), whose sum is σ = 466568601600. Its totient is φ = 208885968720.
The previous prime is 314131043207. The next prime is 314131043267. The reversal of 314131043241 is 142340131413.
314131043241 is a `hidden beast` number, since 3 + 1 + 413 + 1 + 0 + 4 + 3 + 241 = 666.
It is not a de Polignac number, because 314131043241 - 27 = 314131043113 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (314131043641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 33275400 + ... + 33284838.
It is an arithmetic number, because the mean of its divisors is an integer number (14580268800).
Almost surely, 2314131043241 is an apocalyptic number.
It is an amenable number.
314131043241 is a deficient number, since it is larger than the sum of its proper divisors (152437558359).
314131043241 is a wasteful number, since it uses less digits than its factorization.
314131043241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12466 (or 12460 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 314131043241 its reverse (142340131413), we get a palindrome (456471174654).
The spelling of 314131043241 in words is "three hundred fourteen billion, one hundred thirty-one million, forty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •