Base | Representation |
---|---|
bin | 1011111010001001000… |
… | …11001011110001001111 |
3 | 1110010010220020120110100 |
4 | 11331010203023301033 |
5 | 23200441010421210 |
6 | 511545423142143 |
7 | 41363443222515 |
oct | 5750443136117 |
9 | 1403126216410 |
10 | 409171967055 |
11 | 14858a9a9a65 |
12 | 67372a44953 |
13 | 2c77a90c097 |
14 | 15b383804b5 |
15 | a99bc435c0 |
hex | 5f448cbc4f |
409171967055 has 12 divisors (see below), whose sum is σ = 709231409640. Its totient is φ = 218225049072.
The previous prime is 409171967033. The next prime is 409171967077. The reversal of 409171967055 is 550769171904.
409171967055 is a `hidden beast` number, since 409 + 171 + 9 + 67 + 0 + 5 + 5 = 666.
It is an interprime number because it is at equal distance from previous prime (409171967033) and next prime (409171967077).
It is not a de Polignac number, because 409171967055 - 26 = 409171966991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 409171966992 and 409171967010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4546355145 + ... + 4546355234.
It is an arithmetic number, because the mean of its divisors is an integer number (59102617470).
Almost surely, 2409171967055 is an apocalyptic number.
409171967055 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
409171967055 is a deficient number, since it is larger than the sum of its proper divisors (300059442585).
409171967055 is a wasteful number, since it uses less digits than its factorization.
409171967055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9092710390 (or 9092710387 counting only the distinct ones).
The product of its (nonzero) digits is 2381400, while the sum is 54.
The spelling of 409171967055 in words is "four hundred nine billion, one hundred seventy-one million, nine hundred sixty-seven thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •