Base | Representation |
---|---|
bin | 100011101110011010110111… |
… | …0010000110001110101101001 |
3 | 1112012122100110011211010121220 |
4 | 1013130311232100301311221 |
5 | 312142024413304312131 |
6 | 3032201145120052253 |
7 | 123122213521004130 |
oct | 10734655620616551 |
9 | 1465570404733556 |
10 | 314243132104041 |
11 | 91144844853488 |
12 | 2b2b2511164089 |
13 | 106460005b608a |
14 | 578563d506917 |
15 | 264e2b9653e96 |
hex | 11dcd6e431d69 |
314243132104041 has 16 divisors (see below), whose sum is σ = 480850220083200. Its totient is φ = 178816175587728.
The previous prime is 314243132104009. The next prime is 314243132104129. The reversal of 314243132104041 is 140401231342413.
It is a happy number.
It is not a de Polignac number, because 314243132104041 - 25 = 314243132104009 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 314243132103993 and 314243132104011.
It is not an unprimeable number, because it can be changed into a prime (314243132104241) 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, 31305347851 + ... + 31305357888.
It is an arithmetic number, because the mean of its divisors is an integer number (30053138755200).
Almost surely, 2314243132104041 is an apocalyptic number.
It is an amenable number.
314243132104041 is a deficient number, since it is larger than the sum of its proper divisors (166607087979159).
314243132104041 is a wasteful number, since it uses less digits than its factorization.
314243132104041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62610705988.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 314243132104041 its reverse (140401231342413), we get a palindrome (454644363446454).
The spelling of 314243132104041 in words is "three hundred fourteen trillion, two hundred forty-three billion, one hundred thirty-two million, one hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •