Base | Representation |
---|---|
bin | 101111000101011000… |
… | …0000011010101101001 |
3 | 100122222200020212221001 |
4 | 1132022300003111221 |
5 | 3124034144201301 |
6 | 114241131115001 |
7 | 10206436446100 |
oct | 1361260032551 |
9 | 318880225831 |
10 | 101112100201 |
11 | 39977165482 |
12 | 1771a2a2a61 |
13 | 96c5038bb8 |
14 | 4c72a2d037 |
15 | 296bbb0c01 |
hex | 178ac03569 |
101112100201 has 6 divisors (see below), whose sum is σ = 117620198250. Its totient is φ = 86667514416.
The previous prime is 101112100171. The next prime is 101112100261. The reversal of 101112100201 is 102001211101.
It can be written as a sum of positive squares in only one way, i.e., 65165836176 + 35946264025 = 255276^2 + 189595^2 .
It is not a de Polignac number, because 101112100201 - 233 = 92522165609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101112100261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1031756076 + ... + 1031756173.
It is an arithmetic number, because the mean of its divisors is an integer number (19603366375).
Almost surely, 2101112100201 is an apocalyptic number.
It is an amenable number.
101112100201 is a deficient number, since it is larger than the sum of its proper divisors (16508098049).
101112100201 is an equidigital number, since it uses as much as digits as its factorization.
101112100201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2063512263 (or 2063512256 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101112100201 its reverse (102001211101), we get a palindrome (203113311302).
The spelling of 101112100201 in words is "one hundred one billion, one hundred twelve million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •