Base | Representation |
---|---|
bin | 110000011101011101001011… |
… | …110001001000011111011001 |
3 | 1000221122001220100101202221012 |
4 | 300131131023301020133121 |
5 | 210413412111411103231 |
6 | 2033142434104223305 |
7 | 62615110552001156 |
oct | 6035351361103731 |
9 | 1027561810352835 |
10 | 213130433300441 |
11 | 61a01122332208 |
12 | 1baa2132a6ab35 |
13 | 91c016281c6c7 |
14 | 3a8b7d48a722d |
15 | 1999029629e2b |
hex | c1d74bc487d9 |
213130433300441 has 32 divisors (see below), whose sum is σ = 235606177474560. Its totient is φ = 192053362265856.
The previous prime is 213130433300431. The next prime is 213130433300443. The reversal of 213130433300441 is 144003334031312.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 213130433300441 - 210 = 213130433299417 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 213130433300398 and 213130433300407.
It is not an unprimeable number, because it can be changed into a prime (213130433300443) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4601 + ... + 20646086.
It is an arithmetic number, because the mean of its divisors is an integer number (7362693046080).
Almost surely, 2213130433300441 is an apocalyptic number.
It is an amenable number.
213130433300441 is a deficient number, since it is larger than the sum of its proper divisors (22475744174119).
213130433300441 is a wasteful number, since it uses less digits than its factorization.
213130433300441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20651073.
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 213130433300441 its reverse (144003334031312), we get a palindrome (357133767331753).
The spelling of 213130433300441 in words is "two hundred thirteen trillion, one hundred thirty billion, four hundred thirty-three million, three hundred thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •