Base | Representation |
---|---|
bin | 10011000111110110011… |
… | …111011011111110000001 |
3 | 11122121220220212002222210 |
4 | 103013312133123332001 |
5 | 133012234204231231 |
6 | 2443404525252333 |
7 | 163640430423405 |
oct | 23076637337601 |
9 | 4577826762883 |
10 | 1314100461441 |
11 | 4673414a7609 |
12 | 1928217040a9 |
13 | 96bc447bb51 |
14 | 47862133105 |
15 | 242b1c9ea46 |
hex | 131f67dbf81 |
1314100461441 has 8 divisors (see below), whose sum is σ = 1778285201824. Its totient is φ = 862991347680.
The previous prime is 1314100461409. The next prime is 1314100461449. The reversal of 1314100461441 is 1441640014131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1314100461441 - 25 = 1314100461409 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1314100461399 and 1314100461408.
It is not an unprimeable number, because it can be changed into a prime (1314100461449) 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, 3268906420 + ... + 3268906821.
It is an arithmetic number, because the mean of its divisors is an integer number (222285650228).
Almost surely, 21314100461441 is an apocalyptic number.
It is an amenable number.
1314100461441 is a deficient number, since it is larger than the sum of its proper divisors (464184740383).
1314100461441 is an equidigital number, since it uses as much as digits as its factorization.
1314100461441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6537813311.
The product of its (nonzero) digits is 4608, while the sum is 30.
Adding to 1314100461441 its reverse (1441640014131), we get a palindrome (2755740475572).
The spelling of 1314100461441 in words is "one trillion, three hundred fourteen billion, one hundred million, four hundred sixty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •