Base | Representation |
---|---|
bin | 101111000010001000… |
… | …0101110000000111101 |
3 | 100122201002101100121212 |
4 | 1132010100232000331 |
5 | 3123323311114401 |
6 | 114222241334205 |
7 | 10203645142124 |
oct | 1360420560075 |
9 | 318632340555 |
10 | 101003223101 |
11 | 39920760500 |
12 | 176a9937365 |
13 | 96a8607991 |
14 | 4c623aaabb |
15 | 2962355dbb |
hex | 178442e03d |
101003223101 has 12 divisors (see below), whose sum is σ = 111056423100. Its totient is φ = 91791047040.
The previous prime is 101003223089. The next prime is 101003223161. The reversal of 101003223101 is 101322300101.
It can be written as a sum of positive squares in 2 ways, for example, as 85164748900 + 15838474201 = 291830^2 + 125851^2 .
It is a de Polignac number, because none of the positive numbers 2k-101003223101 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 (101003223161) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 238655 + ... + 508883.
It is an arithmetic number, because the mean of its divisors is an integer number (9254701925).
Almost surely, 2101003223101 is an apocalyptic number.
101003223101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101003223101 is a deficient number, since it is larger than the sum of its proper divisors (10053199999).
101003223101 is a wasteful number, since it uses less digits than its factorization.
101003223101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 273340 (or 273329 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 101003223101 its reverse (101322300101), we get a palindrome (202325523202).
The spelling of 101003223101 in words is "one hundred one billion, three million, two hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •