Base | Representation |
---|---|
bin | 10111000010100011000000… |
… | …101100000000110011000111 |
3 | 111021210001200222101220100000 |
4 | 113002203000230000303013 |
5 | 101240143021402212221 |
6 | 555302223355452343 |
7 | 30225600240655401 |
oct | 2702430054006307 |
9 | 437701628356300 |
10 | 101330101210311 |
11 | 2a317944510186 |
12 | b446551a570b3 |
13 | 4470506580b1c |
14 | 1b0459002db71 |
15 | baac66161e26 |
hex | 5c28c0b00cc7 |
101330101210311 has 48 divisors (see below), whose sum is σ = 153400711257248. Its totient is φ = 66835503820800.
The previous prime is 101330101210307. The next prime is 101330101210367. The reversal of 101330101210311 is 113012101033101.
101330101210311 is a `hidden beast` number, since 1 + 0 + 1 + 330 + 1 + 0 + 1 + 21 + 0 + 311 = 666.
It is not a de Polignac number, because 101330101210311 - 22 = 101330101210307 is a prime.
It is a super-2 number, since 2×1013301012103112 (a number of 29 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 (101330101210411) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 72876381 + ... + 74253801.
Almost surely, 2101330101210311 is an apocalyptic number.
101330101210311 is a deficient number, since it is larger than the sum of its proper divisors (52070610046937).
101330101210311 is an equidigital number, since it uses as much as digits as its factorization.
101330101210311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1380654 (or 1380642 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 101330101210311 its reverse (113012101033101), we get a palindrome (214342202243412).
The spelling of 101330101210311 in words is "one hundred one trillion, three hundred thirty billion, one hundred one million, two hundred ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •