Base | Representation |
---|---|
bin | 11000010100110… |
… | …10001001011011 |
3 | 112012222002000110 |
4 | 30022122021123 |
5 | 404214231011 |
6 | 32125335403 |
7 | 5025303630 |
oct | 1412321133 |
9 | 465862013 |
10 | 204055131 |
11 | a5202705 |
12 | 58407563 |
13 | 33376ca7 |
14 | 1d15a187 |
15 | 12daaba6 |
hex | c29a25b |
204055131 has 16 divisors (see below), whose sum is σ = 329232384. Its totient is φ = 109743744.
The previous prime is 204055127. The next prime is 204055139. The reversal of 204055131 is 131550402.
It is not a de Polignac number, because 204055131 - 22 = 204055127 is a prime.
It is a super-2 number, since 2×2040551312 = 83276992974854322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 204055098 and 204055107.
It is not an unprimeable number, because it can be changed into a prime (204055139) 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 15 ways as a sum of consecutive naturals, for example, 285435 + ... + 286148.
It is an arithmetic number, because the mean of its divisors is an integer number (20577024).
Almost surely, 2204055131 is an apocalyptic number.
204055131 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
204055131 is a deficient number, since it is larger than the sum of its proper divisors (125177253).
204055131 is a wasteful number, since it uses less digits than its factorization.
204055131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 571610.
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 204055131 is about 14284.7866977425. The cubic root of 204055131 is about 588.7295568562.
The spelling of 204055131 in words is "two hundred four million, fifty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •