Base | Representation |
---|---|
bin | 110000110010010111… |
… | …1100100100011001101 |
3 | 101000102120010022221010 |
4 | 1201210233210203031 |
5 | 3204031432012211 |
6 | 120044055555433 |
7 | 10366166160465 |
oct | 1414457444315 |
9 | 330376108833 |
10 | 104769407181 |
11 | 4048366532a |
12 | 1837b08bb79 |
13 | 9b5896227a |
14 | 50dc658ba5 |
15 | 2ad2ce24a6 |
hex | 1864be48cd |
104769407181 has 16 divisors (see below), whose sum is σ = 142837392384. Its totient is φ = 68277444144.
The previous prime is 104769407173. The next prime is 104769407189. The reversal of 104769407181 is 181704967401.
It is an interprime number because it is at equal distance from previous prime (104769407173) and next prime (104769407189).
It is not a de Polignac number, because 104769407181 - 23 = 104769407173 is a prime.
It is a super-3 number, since 3×1047694071813 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 104769407181.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104769407189) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 332635 + ... + 565848.
It is an arithmetic number, because the mean of its divisors is an integer number (8927337024).
Almost surely, 2104769407181 is an apocalyptic number.
It is an amenable number.
104769407181 is a deficient number, since it is larger than the sum of its proper divisors (38067985203).
104769407181 is an equidigital number, since it uses as much as digits as its factorization.
104769407181 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 899360.
The product of its (nonzero) digits is 338688, while the sum is 48.
The spelling of 104769407181 in words is "one hundred four billion, seven hundred sixty-nine million, four hundred seven thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •