Base | Representation |
---|---|
bin | 10110111110001011101101… |
… | …001100110101000111101011 |
3 | 111020201101121100221011002210 |
4 | 112332023231030311013223 |
5 | 101220234322234100021 |
6 | 554512344442300203 |
7 | 30165122355204213 |
oct | 2676135514650753 |
9 | 436641540834083 |
10 | 101030200300011 |
11 | 2a2117382434a4 |
12 | b3b83b57b7663 |
13 | 444b151137598 |
14 | 1ad3c60123243 |
15 | ba3062527e76 |
hex | 5be2ed3351eb |
101030200300011 has 4 divisors (see below), whose sum is σ = 134706933733352. Its totient is φ = 67353466866672.
The previous prime is 101030200299893. The next prime is 101030200300069. The reversal of 101030200300011 is 110003002030101.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 101030200300011 - 27 = 101030200299883 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101030200300011.
It is not an unprimeable number, because it can be changed into a prime (101030200300091) 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, 16838366716666 + ... + 16838366716671.
It is an arithmetic number, because the mean of its divisors is an integer number (33676733433338).
Almost surely, 2101030200300011 is an apocalyptic number.
101030200300011 is a deficient number, since it is larger than the sum of its proper divisors (33676733433341).
101030200300011 is an equidigital number, since it uses as much as digits as its factorization.
101030200300011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33676733433340.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 101030200300011 its reverse (110003002030101), we get a palindrome (211033202330112).
The spelling of 101030200300011 in words is "one hundred one trillion, thirty billion, two hundred million, three hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •