Base | Representation |
---|---|
bin | 1001001001010010011… |
… | …10010010011111010011 |
3 | 1010001001211022111010001 |
4 | 10210221032102133103 |
5 | 20122012400133321 |
6 | 400204055350431 |
7 | 31462524556642 |
oct | 4445116223723 |
9 | 1101054274101 |
10 | 314224224211 |
11 | 1112974234a7 |
12 | 50a95082417 |
13 | 23828a26b21 |
14 | 112cc305359 |
15 | 8291333c91 |
hex | 49293927d3 |
314224224211 has 8 divisors (see below), whose sum is σ = 317041920720. Its totient is φ = 311407176192.
The previous prime is 314224224203. The next prime is 314224224221. The reversal of 314224224211 is 112422422413.
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 314224224211 - 23 = 314224224203 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 314224224211.
It is not an unprimeable number, because it can be changed into a prime (314224224221) 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 7 ways as a sum of consecutive naturals, for example, 838891 + ... + 1154203.
It is an arithmetic number, because the mean of its divisors is an integer number (39630240090).
Almost surely, 2314224224211 is an apocalyptic number.
314224224211 is a deficient number, since it is larger than the sum of its proper divisors (2817696509).
314224224211 is a wasteful number, since it uses less digits than its factorization.
314224224211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 324245.
The product of its digits is 6144, while the sum is 28.
Adding to 314224224211 its reverse (112422422413), we get a palindrome (426646646624).
The spelling of 314224224211 in words is "three hundred fourteen billion, two hundred twenty-four million, two hundred twenty-four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •