Base | Representation |
---|---|
bin | 110000100110111000… |
… | …0100000010000000111 |
3 | 100222102200111020001120 |
4 | 1201031300200100013 |
5 | 3202234221311001 |
6 | 115541522325023 |
7 | 10353504311553 |
oct | 1411560402007 |
9 | 328380436046 |
10 | 104383775751 |
11 | 402a5a13772 |
12 | 18291ab9773 |
13 | 9ac6ab1aa8 |
14 | 50a3354863 |
15 | 2aae01b236 |
hex | 184dc20407 |
104383775751 has 32 divisors (see below), whose sum is σ = 147879986688. Its totient is φ = 65267389440.
The previous prime is 104383775737. The next prime is 104383775761. The reversal of 104383775751 is 157577383401.
It is not a de Polignac number, because 104383775751 - 214 = 104383759367 is a prime.
It is a super-2 number, since 2×1043837757512 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 104383775694 and 104383775703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104383775761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19519260 + ... + 19524606.
It is an arithmetic number, because the mean of its divisors is an integer number (4621249584).
Almost surely, 2104383775751 is an apocalyptic number.
104383775751 is a deficient number, since it is larger than the sum of its proper divisors (43496210937).
104383775751 is a wasteful number, since it uses less digits than its factorization.
104383775751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6631.
The product of its (nonzero) digits is 2469600, while the sum is 51.
The spelling of 104383775751 in words is "one hundred four billion, three hundred eighty-three million, seven hundred seventy-five thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •