Base | Representation |
---|---|
bin | 100011101101110001000100… |
… | …0010110011001101000001111 |
3 | 1112012022202202212212210202222 |
4 | 1013123202020112121220033 |
5 | 312134042103110102033 |
6 | 3032052022432005555 |
7 | 123112555335141434 |
oct | 10733421026315017 |
9 | 1465282685783688 |
10 | 314153375472143 |
11 | 9110a775546459 |
12 | 2b2990419908bb |
13 | 1063a6c80239bc |
14 | 5781166a79b8b |
15 | 264bcb484b598 |
hex | 11db888599a0f |
314153375472143 has 4 divisors (see below), whose sum is σ = 314153464216560. Its totient is φ = 314153286727728.
The previous prime is 314153375472137. The next prime is 314153375472179. The reversal of 314153375472143 is 341274573351413.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 314153375472143 - 210 = 314153375471119 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314153375477143) 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 3 ways as a sum of consecutive naturals, for example, 38831630 + ... + 46219067.
It is an arithmetic number, because the mean of its divisors is an integer number (78538366054140).
Almost surely, 2314153375472143 is an apocalyptic number.
314153375472143 is a deficient number, since it is larger than the sum of its proper divisors (88744417).
314153375472143 is an equidigital number, since it uses as much as digits as its factorization.
314153375472143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88744416.
The product of its digits is 12700800, while the sum is 53.
The spelling of 314153375472143 in words is "three hundred fourteen trillion, one hundred fifty-three billion, three hundred seventy-five million, four hundred seventy-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •