Base | Representation |
---|---|
bin | 110110000010010010… |
… | …1011110010110011101 |
3 | 102002112002201002101012 |
4 | 1230010211132112131 |
5 | 3400123002041001 |
6 | 125150350225005 |
7 | 11245414434446 |
oct | 1540445362635 |
9 | 362462632335 |
10 | 116041049501 |
11 | 45238169003 |
12 | 1a5a5ab5165 |
13 | ac33c39100 |
14 | 588b63a2cd |
15 | 304263d2bb |
hex | 1b0495e59d |
116041049501 has 6 divisors (see below), whose sum is σ = 125653917690. Its totient is φ = 107114814768.
The previous prime is 116041049461. The next prime is 116041049503. The reversal of 116041049501 is 105940140611.
116041049501 = 2408742 + 2408752.
It can be written as a sum of positive squares in 3 ways, for example, as 2033476 + 116039016025 = 1426^2 + 340645^2 .
It is not a de Polignac number, because 116041049501 - 226 = 115973940637 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 (116041049503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 343316546 + ... + 343316883.
It is an arithmetic number, because the mean of its divisors is an integer number (20942319615).
Almost surely, 2116041049501 is an apocalyptic number.
116041049501 is the 240875-th centered square number.
It is an amenable number.
116041049501 is a deficient number, since it is larger than the sum of its proper divisors (9612868189).
116041049501 is an equidigital number, since it uses as much as digits as its factorization.
116041049501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 686633455 (or 686633442 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 32.
The spelling of 116041049501 in words is "one hundred sixteen billion, forty-one million, forty-nine thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •