Base | Representation |
---|---|
bin | 100011101110110110000000… |
… | …0100011101010110000001111 |
3 | 1112012211220220102212010202112 |
4 | 1013131230000203222300033 |
5 | 312144003302300313033 |
6 | 3032244025103414235 |
7 | 123126346133224004 |
oct | 10735540043526017 |
9 | 1465756812763675 |
10 | 314301421104143 |
11 | 91167536434a40 |
12 | 2b301879bb437b |
13 | 1064b65c714c95 |
14 | 57883aca4d8ab |
15 | 2650a7ba7dc48 |
hex | 11ddb008eac0f |
314301421104143 has 128 divisors (see below), whose sum is σ = 393928268267520. Its totient is φ = 247217588766720.
The previous prime is 314301421104113. The next prime is 314301421104149. The reversal of 314301421104143 is 341401124103413.
It is a happy number.
It is not a de Polignac number, because 314301421104143 - 230 = 314300347362319 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314301421104149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2733782846 + ... + 2733897812.
It is an arithmetic number, because the mean of its divisors is an integer number (3077564595840).
Almost surely, 2314301421104143 is an apocalyptic number.
314301421104143 is a deficient number, since it is larger than the sum of its proper divisors (79626847163377).
314301421104143 is a wasteful number, since it uses less digits than its factorization.
314301421104143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115317.
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 314301421104143 its reverse (341401124103413), we get a palindrome (655702545207556).
The spelling of 314301421104143 in words is "three hundred fourteen trillion, three hundred one billion, four hundred twenty-one million, one hundred four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •