Base | Representation |
---|---|
bin | 1110010100001111100000… |
… | …01101110011100011100111 |
3 | 11010110122010221100212122110 |
4 | 13022013300031303203213 |
5 | 13111244304414311041 |
6 | 150542320554132103 |
7 | 6426326323116240 |
oct | 712076015634347 |
9 | 133418127325573 |
10 | 31481845463271 |
11 | a038415041285 |
12 | 3645486421033 |
13 | 14749575c8418 |
14 | 7aba2d87dcc7 |
15 | 398dad441516 |
hex | 1ca1f03738e7 |
31481845463271 has 128 divisors (see below), whose sum is σ = 52339669401600. Its totient is φ = 16425553351680.
The previous prime is 31481845463249. The next prime is 31481845463323. The reversal of 31481845463271 is 17236454818413.
It is not a de Polignac number, because 31481845463271 - 25 = 31481845463239 is a prime.
It is a super-2 number, since 2×314818454632712 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31481845464271) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 9810483115 + ... + 9810486323.
It is an arithmetic number, because the mean of its divisors is an integer number (408903667200).
Almost surely, 231481845463271 is an apocalyptic number.
31481845463271 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
31481845463271 is a deficient number, since it is larger than the sum of its proper divisors (20857823938329).
31481845463271 is a wasteful number, since it uses less digits than its factorization.
31481845463271 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6269.
The product of its digits is 15482880, while the sum is 57.
The spelling of 31481845463271 in words is "thirty-one trillion, four hundred eighty-one billion, eight hundred forty-five million, four hundred sixty-three thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •