Base | Representation |
---|---|
bin | 1110010011000111011010… |
… | …11001101100001011001011 |
3 | 11010022221020201212112122121 |
4 | 13021203231121230023023 |
5 | 13110131024221311301 |
6 | 150512440345432111 |
7 | 6423456260163025 |
oct | 711435531541313 |
9 | 133287221775577 |
10 | 31443143541451 |
11 | a022a64898624 |
12 | 3639a8519b637 |
13 | 14710ca45a175 |
14 | 7a9bdb853015 |
15 | 397d958ba3a1 |
hex | 1c98ed66c2cb |
31443143541451 has 8 divisors (see below), whose sum is σ = 31986902384640. Its totient is φ = 30904012433448.
The previous prime is 31443143541401. The next prime is 31443143541533. The reversal of 31443143541451 is 15414534134413.
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 31443143541451 - 243 = 22647050519243 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31443143541398 and 31443143541407.
It is not an unprimeable number, because it can be changed into a prime (31443143541401) 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, 1156920091 + ... + 1156947268.
It is an arithmetic number, because the mean of its divisors is an integer number (3998362798080).
Almost surely, 231443143541451 is an apocalyptic number.
31443143541451 is a deficient number, since it is larger than the sum of its proper divisors (543758843189).
31443143541451 is a wasteful number, since it uses less digits than its factorization.
31443143541451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2313867593.
The product of its digits is 691200, while the sum is 43.
Adding to 31443143541451 its reverse (15414534134413), we get a palindrome (46857677675864).
The spelling of 31443143541451 in words is "thirty-one trillion, four hundred forty-three billion, one hundred forty-three million, five hundred forty-one thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •