Base | Representation |
---|---|
bin | 10111000010100011000000… |
… | …101011111111000001000011 |
3 | 111021210001200222101112022122 |
4 | 113002203000223333001003 |
5 | 101240143021401444021 |
6 | 555302223355354455 |
7 | 30225600240625202 |
oct | 2702430053770103 |
9 | 437701628345278 |
10 | 101330101203011 |
11 | 2a31794450574a |
12 | b446551a52a2b |
13 | 447050657a6c5 |
14 | 1b0459002b239 |
15 | baac6615ebab |
hex | 5c28c0aff043 |
101330101203011 has 4 divisors (see below), whose sum is σ = 101335070090232. Its totient is φ = 101325132315792.
The previous prime is 101330101202977. The next prime is 101330101203017. The reversal of 101330101203011 is 110302101033101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101330101203011 is a prime.
It is a super-2 number, since 2×1013301012030112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101330101203017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2484413021 + ... + 2484453806.
It is an arithmetic number, because the mean of its divisors is an integer number (25333767522558).
Almost surely, 2101330101203011 is an apocalyptic number.
101330101203011 is a deficient number, since it is larger than the sum of its proper divisors (4968887221).
101330101203011 is an equidigital number, since it uses as much as digits as its factorization.
101330101203011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4968887220.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 101330101203011 its reverse (110302101033101), we get a palindrome (211632202236112).
The spelling of 101330101203011 in words is "one hundred one trillion, three hundred thirty billion, one hundred one million, two hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •