Base | Representation |
---|---|
bin | 10011001000001010010… |
… | …000010100010010010011 |
3 | 11122122210000210011012002 |
4 | 103020022100110102103 |
5 | 133013424100322011 |
6 | 2443501452224215 |
7 | 163651565004065 |
oct | 23101220242223 |
9 | 4578700704162 |
10 | 1314432042131 |
11 | 4674a169103a |
12 | 1928b476b06b |
13 | 96c48086240 |
14 | 478941a7735 |
15 | 242d0e4ac3b |
hex | 1320a414493 |
1314432042131 has 8 divisors (see below), whose sum is σ = 1419181130640. Its totient is φ = 1210202800992.
The previous prime is 1314432042019. The next prime is 1314432042167. The reversal of 1314432042131 is 1312402344131.
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 1314432042131 - 226 = 1314364933267 is a prime.
It is a super-2 number, since 2×13144320421312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1314432042094 and 1314432042103.
It is not an unprimeable number, because it can be changed into a prime (1314432044131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 129956585 + ... + 129966698.
It is an arithmetic number, because the mean of its divisors is an integer number (177397641330).
Almost surely, 21314432042131 is an apocalyptic number.
1314432042131 is a deficient number, since it is larger than the sum of its proper divisors (104749088509).
1314432042131 is a wasteful number, since it uses less digits than its factorization.
1314432042131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 259923685.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 1314432042131 its reverse (1312402344131), we get a palindrome (2626834386262).
The spelling of 1314432042131 in words is "one trillion, three hundred fourteen billion, four hundred thirty-two million, forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •