Base | Representation |
---|---|
bin | 1110001101010011001111… |
… | …01010000110111111100001 |
3 | 11002121211111110201001110110 |
4 | 13012221213222012333201 |
5 | 13043342320241444131 |
6 | 150240553241521533 |
7 | 6403153605264246 |
oct | 706514752067741 |
9 | 132554443631413 |
10 | 31243331203041 |
11 | 9a56249a52351 |
12 | 36072004a32a9 |
13 | 1458305c95269 |
14 | 7a02846615cd |
15 | 392a9db64646 |
hex | 1c6a67a86fe1 |
31243331203041 has 8 divisors (see below), whose sum is σ = 41819867447904. Its totient is φ = 20747841213440.
The previous prime is 31243331202983. The next prime is 31243331203069. The reversal of 31243331203041 is 14030213334213.
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 31243331203041 - 27 = 31243331202913 is a prime.
It is a super-2 number, since 2×312433312030412 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (31243331203081) 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, 20261562915 + ... + 20261564456.
It is an arithmetic number, because the mean of its divisors is an integer number (5227483430988).
Almost surely, 231243331203041 is an apocalyptic number.
It is an amenable number.
31243331203041 is a deficient number, since it is larger than the sum of its proper divisors (10576536244863).
31243331203041 is a wasteful number, since it uses less digits than its factorization.
31243331203041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40523127631.
The product of its (nonzero) digits is 15552, while the sum is 30.
Adding to 31243331203041 its reverse (14030213334213), we get a palindrome (45273544537254).
The spelling of 31243331203041 in words is "thirty-one trillion, two hundred forty-three billion, three hundred thirty-one million, two hundred three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •