Base | Representation |
---|---|
bin | 101111000010011011… |
… | …1001010010001010111 |
3 | 100122201210100022221212 |
4 | 1132010313022101113 |
5 | 3123333401102221 |
6 | 114223241332035 |
7 | 10204126612550 |
oct | 1360467122127 |
9 | 318653308855 |
10 | 101013300311 |
11 | 39926413680 |
12 | 176b119701b |
13 | 96aa725721 |
14 | 4c63871327 |
15 | 2963196b5b |
hex | 1784dca457 |
101013300311 has 8 divisors (see below), whose sum is σ = 125938660224. Its totient is φ = 78711662520.
The previous prime is 101013300307. The next prime is 101013300373. The reversal of 101013300311 is 113003310101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101013300311 - 22 = 101013300307 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101013300211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 655930445 + ... + 655930598.
It is an arithmetic number, because the mean of its divisors is an integer number (15742332528).
Almost surely, 2101013300311 is an apocalyptic number.
101013300311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101013300311 is a deficient number, since it is larger than the sum of its proper divisors (24925359913).
101013300311 is a wasteful number, since it uses less digits than its factorization.
101013300311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1311861061.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 101013300311 its reverse (113003310101), we get a palindrome (214016610412).
The spelling of 101013300311 in words is "one hundred one billion, thirteen million, three hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •