Base | Representation |
---|---|
bin | 10110111111010111000011… |
… | …110011001110010000100010 |
3 | 111021000010110002222212001201 |
4 | 112333113003303032100202 |
5 | 101223101023141200002 |
6 | 555013445220151414 |
7 | 30204015365152012 |
oct | 2677270363162042 |
9 | 437003402885051 |
10 | 101111110100002 |
11 | 2a242a877657a2 |
12 | b41001623856a |
13 | 44559768b7592 |
14 | 1ad7b37a49c42 |
15 | ba51ea80c087 |
hex | 5bf5c3cce422 |
101111110100002 has 4 divisors (see below), whose sum is σ = 151666665150006. Its totient is φ = 50555555050000.
The previous prime is 101111110099981. The next prime is 101111110100009. The reversal of 101111110100002 is 200001011111101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 87079710385801 + 14031399714201 = 9331651^2 + 3745851^2 .
It is a super-3 number, since 3×1011111101000023 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (101111110100009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25277777524999 + ... + 25277777525002.
Almost surely, 2101111110100002 is an apocalyptic number.
101111110100002 is a deficient number, since it is larger than the sum of its proper divisors (50555555050004).
101111110100002 is an equidigital number, since it uses as much as digits as its factorization.
101111110100002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50555555050003.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 101111110100002 its reverse (200001011111101), we get a palindrome (301112121211103).
The spelling of 101111110100002 in words is "one hundred one trillion, one hundred eleven billion, one hundred ten million, one hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •