Base | Representation |
---|---|
bin | 10111000010011001110010… |
… | …100010000000101110001001 |
3 | 111021202010010221120212212100 |
4 | 113002121302202000232021 |
5 | 101240012232201443423 |
6 | 555253505103104013 |
7 | 30225100003224630 |
oct | 2702316242005611 |
9 | 437663127525770 |
10 | 101320200031113 |
11 | 2a313723561758 |
12 | b444649ba2009 |
13 | 446c5b91b34cb |
14 | 1b03cd1072517 |
15 | baa886cc4343 |
hex | 5c2672880b89 |
101320200031113 has 12 divisors (see below), whose sum is σ = 167258742908608. Its totient is φ = 57897257160600.
The previous prime is 101320200031093. The next prime is 101320200031189. The reversal of 101320200031113 is 311130002023101.
101320200031113 is a `hidden beast` number, since 1 + 0 + 1 + 320 + 20 + 0 + 0 + 311 + 13 = 666.
It is not a de Polignac number, because 101320200031113 - 226 = 101320132922249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101320200031013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 804128571613 + ... + 804128571738.
Almost surely, 2101320200031113 is an apocalyptic number.
It is an amenable number.
101320200031113 is a deficient number, since it is larger than the sum of its proper divisors (65938542877495).
101320200031113 is a wasteful number, since it uses less digits than its factorization.
101320200031113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1608257143364 (or 1608257143361 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 101320200031113 its reverse (311130002023101), we get a palindrome (412450202054214).
The spelling of 101320200031113 in words is "one hundred one trillion, three hundred twenty billion, two hundred million, thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •