Base | Representation |
---|---|
bin | 1110001001010111010001… |
… | …11100001110110101001101 |
3 | 11002010220100021110000121000 |
4 | 13010223220330032311031 |
5 | 13034133302140324013 |
6 | 150054502425330513 |
7 | 6360324520612623 |
oct | 704535074166515 |
9 | 132126307400530 |
10 | 31108061261133 |
11 | 9a0394466192a |
12 | 35a4b4a936a39 |
13 | 144862935960c |
14 | 7978d1307513 |
15 | 38e2d3326973 |
hex | 1c4ae8f0ed4d |
31108061261133 has 16 divisors (see below), whose sum is σ = 46130630487040. Its totient is φ = 20718631295712.
The previous prime is 31108061261119. The next prime is 31108061261209. The reversal of 31108061261133 is 33116216080113.
31108061261133 is a `hidden beast` number, since 3 + 1 + 1 + 0 + 8 + 0 + 6 + 1 + 2 + 611 + 33 = 666.
It is not a de Polignac number, because 31108061261133 - 213 = 31108061252941 is a prime.
It is a super-2 number, since 2×311080612611332 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31108061261033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 557644141 + ... + 557699922.
It is an arithmetic number, because the mean of its divisors is an integer number (2883164405440).
Almost surely, 231108061261133 is an apocalyptic number.
It is an amenable number.
31108061261133 is a deficient number, since it is larger than the sum of its proper divisors (15022569225907).
31108061261133 is a wasteful number, since it uses less digits than its factorization.
31108061261133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1115345105 (or 1115345099 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The spelling of 31108061261133 in words is "thirty-one trillion, one hundred eight billion, sixty-one million, two hundred sixty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •