Base | Representation |
---|---|
bin | 101111000101111110… |
… | …0010110001001111111 |
3 | 100200001001212222210121 |
4 | 1132023330112021333 |
5 | 3124104304201343 |
6 | 114243123515411 |
7 | 10210101445150 |
oct | 1361374261177 |
9 | 320031788717 |
10 | 101132100223 |
11 | 39987485820 |
12 | 17724b28b67 |
13 | 96c921c32b |
14 | 4c75557927 |
15 | 296d811aed |
hex | 178bf1627f |
101132100223 has 64 divisors (see below), whose sum is σ = 134462177280. Its totient is φ = 73683216000.
The previous prime is 101132100163. The next prime is 101132100271. The reversal of 101132100223 is 322001231101.
It is a de Polignac number, because none of the positive numbers 2k-101132100223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101132100197 and 101132100206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101132100283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 56592336 + ... + 56594122.
It is an arithmetic number, because the mean of its divisors is an integer number (2100971520).
Almost surely, 2101132100223 is an apocalyptic number.
101132100223 is a deficient number, since it is larger than the sum of its proper divisors (33330077057).
101132100223 is a wasteful number, since it uses less digits than its factorization.
101132100223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2308.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 101132100223 its reverse (322001231101), we get a palindrome (423133331324).
The spelling of 101132100223 in words is "one hundred one billion, one hundred thirty-two million, one hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •