Base | Representation |
---|---|
bin | 1110001010001001100000… |
… | …11100101110011001010111 |
3 | 11002020110221211022202222220 |
4 | 13011010300130232121113 |
5 | 13040104020333441033 |
6 | 150115122523353423 |
7 | 6362301041613324 |
oct | 705046034563127 |
9 | 132213854282886 |
10 | 31135030765143 |
11 | 9a143241a6418 |
12 | 35aa216982873 |
13 | 144b036920506 |
14 | 798d2d08bb4b |
15 | 38ed60d85bb3 |
hex | 1c513072e657 |
31135030765143 has 8 divisors (see below), whose sum is σ = 41699532983808. Its totient is φ = 20663607861624.
The previous prime is 31135030765081. The next prime is 31135030765171. The reversal of 31135030765143 is 34156703053113.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31135030765143 - 210 = 31135030764119 is a prime.
It is a super-2 number, since 2×311350307651432 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31135030765095 and 31135030765104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31135030765543) 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, 23269828005 + ... + 23269829342.
It is an arithmetic number, because the mean of its divisors is an integer number (5212441622976).
Almost surely, 231135030765143 is an apocalyptic number.
31135030765143 is a deficient number, since it is larger than the sum of its proper divisors (10564502218665).
31135030765143 is a wasteful number, since it uses less digits than its factorization.
31135030765143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46539657573.
The product of its (nonzero) digits is 340200, while the sum is 42.
The spelling of 31135030765143 in words is "thirty-one trillion, one hundred thirty-five billion, thirty million, seven hundred sixty-five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •