Base | Representation |
---|---|
bin | 1110001101001111110111… |
… | …11000100011011010000001 |
3 | 11002121122211110100100221111 |
4 | 13012213323320203122001 |
5 | 13043330114400100423 |
6 | 150240054010523321 |
7 | 6403061031242335 |
oct | 706477370433201 |
9 | 132548743310844 |
10 | 31241523050113 |
11 | 9a5550132a292 |
12 | 3606996a36541 |
13 | 14580a84ac29c |
14 | 7a01524657c5 |
15 | 3929e504a60d |
hex | 1c69fbe23681 |
31241523050113 has 8 divisors (see below), whose sum is σ = 31244916410496. Its totient is φ = 31238129907600.
The previous prime is 31241523050099. The next prime is 31241523050183. The reversal of 31241523050113 is 31105032514213.
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 31241523050113 - 213 = 31241523041921 is a prime.
It is a super-3 number, since 3×312415230501133 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31241523050183) 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, 496962303 + ... + 497025163.
It is an arithmetic number, because the mean of its divisors is an integer number (3905614551312).
Almost surely, 231241523050113 is an apocalyptic number.
It is an amenable number.
31241523050113 is a deficient number, since it is larger than the sum of its proper divisors (3393360383).
31241523050113 is a wasteful number, since it uses less digits than its factorization.
31241523050113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108935.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 31241523050113 its reverse (31105032514213), we get a palindrome (62346555564326).
The spelling of 31241523050113 in words is "thirty-one trillion, two hundred forty-one billion, five hundred twenty-three million, fifty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •