Base | Representation |
---|---|
bin | 1001001001010001111… |
… | …10101001100100011011 |
3 | 1010001001112121012021210 |
4 | 10210220332221210123 |
5 | 20122010322440233 |
6 | 400203431434203 |
7 | 31462444663161 |
oct | 4445076514433 |
9 | 1101045535253 |
10 | 314220124443 |
11 | 111295083265 |
12 | 50a93825963 |
13 | 23827c1ca24 |
14 | 112cb959231 |
15 | 8290cc4163 |
hex | 4928fa991b |
314220124443 has 8 divisors (see below), whose sum is σ = 437175825408. Its totient is φ = 200372253224.
The previous prime is 314220124409. The next prime is 314220124481. The reversal of 314220124443 is 344421022413.
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 314220124443 - 210 = 314220123419 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 314220124443.
It is not an unprimeable number, because it can be changed into a prime (314220124483) 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, 2276957355 + ... + 2276957492.
It is an arithmetic number, because the mean of its divisors is an integer number (54646978176).
Almost surely, 2314220124443 is an apocalyptic number.
314220124443 is a deficient number, since it is larger than the sum of its proper divisors (122955700965).
314220124443 is a wasteful number, since it uses less digits than its factorization.
314220124443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4553914873.
The product of its (nonzero) digits is 18432, while the sum is 30.
Adding to 314220124443 its reverse (344421022413), we get a palindrome (658641146856).
The spelling of 314220124443 in words is "three hundred fourteen billion, two hundred twenty million, one hundred twenty-four thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •