Base | Representation |
---|---|
bin | 1001001000111011110… |
… | …01001000110011011111 |
3 | 1010000120120121201002000 |
4 | 10210131321020303133 |
5 | 20121120214131033 |
6 | 400133145133343 |
7 | 31455026030556 |
oct | 4443571106337 |
9 | 1100516551060 |
10 | 314034130143 |
11 | 1111aa096a68 |
12 | 50a4148a253 |
13 | 237c852a626 |
14 | 112b0d80d9d |
15 | 827e7d4a13 |
hex | 491de48cdf |
314034130143 has 16 divisors (see below), whose sum is σ = 467440665600. Its totient is φ = 208363874040.
The previous prime is 314034130063. The next prime is 314034130183. The reversal of 314034130143 is 341031430413.
314034130143 is a `hidden beast` number, since 3 + 14 + 0 + 341 + 301 + 4 + 3 = 666.
It is not a de Polignac number, because 314034130143 - 28 = 314034129887 is a prime.
It is a super-2 number, since 2×3140341301432 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314034130183) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27555663 + ... + 27567056.
It is an arithmetic number, because the mean of its divisors is an integer number (29215041600).
Almost surely, 2314034130143 is an apocalyptic number.
314034130143 is a deficient number, since it is larger than the sum of its proper divisors (153406535457).
314034130143 is a wasteful number, since it uses less digits than its factorization.
314034130143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55122939 (or 55122933 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 314034130143 its reverse (341031430413), we get a palindrome (655065560556).
The spelling of 314034130143 in words is "three hundred fourteen billion, thirty-four million, one hundred thirty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •