Base | Representation |
---|---|
bin | 101111000110000101… |
… | …1011000000101000111 |
3 | 100200001100022011112000 |
4 | 1132030023120011013 |
5 | 3124111311242023 |
6 | 114243344200343 |
7 | 10210150105146 |
oct | 1361413300507 |
9 | 320040264460 |
10 | 101136040263 |
11 | 39989726a55 |
12 | 177263090b3 |
13 | 96c9c9b80b |
14 | 4c75ca175d |
15 | 296dd3e243 |
hex | 178c2d8147 |
101136040263 has 16 divisors (see below), whose sum is σ = 158644769760. Its totient is φ = 63457907328.
The previous prime is 101136040223. The next prime is 101136040309. The reversal of 101136040263 is 362040631101.
101136040263 is a `hidden beast` number, since 1 + 0 + 1 + 1 + 360 + 40 + 263 = 666.
It is not a de Polignac number, because 101136040263 - 26 = 101136040199 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101136040223) 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 15 ways as a sum of consecutive naturals, for example, 110169520 + ... + 110170437.
It is an arithmetic number, because the mean of its divisors is an integer number (9915298110).
Almost surely, 2101136040263 is an apocalyptic number.
101136040263 is a deficient number, since it is larger than the sum of its proper divisors (57508729497).
101136040263 is a wasteful number, since it uses less digits than its factorization.
101136040263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220339983 (or 220339977 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 101136040263 its reverse (362040631101), we get a palindrome (463176671364).
The spelling of 101136040263 in words is "one hundred one billion, one hundred thirty-six million, forty thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •