Base | Representation |
---|---|
bin | 10111000000101100101010… |
… | …101110110100101001110011 |
3 | 111021022220201020222021222102 |
4 | 113000230222232310221303 |
5 | 101231102302004004021 |
6 | 555124010350531015 |
7 | 30213451313445455 |
oct | 2700545256645163 |
9 | 437286636867872 |
10 | 101203031313011 |
11 | 2a278a67900631 |
12 | b4259aa506a6b |
13 | 4461535759994 |
14 | 1adc377b742d5 |
15 | ba77ca68700b |
hex | 5c0b2abb4a73 |
101203031313011 has 4 divisors (see below), whose sum is σ = 101210132796024. Its totient is φ = 101195929830000.
The previous prime is 101203031312941. The next prime is 101203031313049. The reversal of 101203031313011 is 110313130302101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101203031313011 - 218 = 101203031050867 is a prime.
It is a super-2 number, since 2×1012030313130112 (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 (101203031312011) 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, 3550720130 + ... + 3550748631.
It is an arithmetic number, because the mean of its divisors is an integer number (25302533199006).
Almost surely, 2101203031313011 is an apocalyptic number.
101203031313011 is a deficient number, since it is larger than the sum of its proper divisors (7101483013).
101203031313011 is an equidigital number, since it uses as much as digits as its factorization.
101203031313011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7101483012.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 101203031313011 its reverse (110313130302101), we get a palindrome (211516161615112).
The spelling of 101203031313011 in words is "one hundred one trillion, two hundred three billion, thirty-one million, three hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •