Base | Representation |
---|---|
bin | 101111000100011000… |
… | …1001101011000010001 |
3 | 100122220100200112220121 |
4 | 1132020301031120101 |
5 | 3124002141132131 |
6 | 114233542310241 |
7 | 10205554016662 |
oct | 1361061153021 |
9 | 318810615817 |
10 | 101078849041 |
11 | 3995a414385 |
12 | 1770b128381 |
13 | 96bb196161 |
14 | 4c6c455369 |
15 | 2968ce3911 |
hex | 1788c4d611 |
101078849041 has 15 divisors (see below), whose sum is σ = 105849447483. Its totient is φ = 96523244400.
The previous prime is 101078849009. The next prime is 101078849059. The reversal of 101078849041 is 140948870101.
It is a happy number.
The square root of 101078849041 is 317929.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 84960007441 + 16118841600 = 291479^2 + 126960^2 .
It is not a de Polignac number, because 101078849041 - 25 = 101078849009 is a prime.
It is a super-3 number, since 3×1010788490413 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101078847041) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 168184141 + ... + 168184741.
Almost surely, 2101078849041 is an apocalyptic number.
101078849041 is the 317929-th square number.
101078849041 is the 158965-th centered octagonal number.
It is an amenable number.
101078849041 is a deficient number, since it is larger than the sum of its proper divisors (4770598442).
101078849041 is an frugal number, since it uses more digits than its factorization.
101078849041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1294 (or 624 counting only the distinct ones).
The product of its (nonzero) digits is 64512, while the sum is 43.
The spelling of 101078849041 in words is "one hundred one billion, seventy-eight million, eight hundred forty-nine thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •