Base | Representation |
---|---|
bin | 110000100001101111100010… |
… | …110001000011000101011001 |
3 | 1000222200020021220112220102101 |
4 | 300201233202301003011121 |
5 | 210433223422222222131 |
6 | 2033530034102203401 |
7 | 62645310031103446 |
oct | 6041574261030531 |
9 | 1028606256486371 |
10 | 213425024414041 |
11 | 62005054337060 |
12 | 1bb2b248a23561 |
13 | 9211b7cb893cb |
14 | 3a9bb7d50c9cd |
15 | 19a1a1c015c61 |
hex | c21be2c43159 |
213425024414041 has 32 divisors (see below), whose sum is σ = 243555244201728. Its totient is φ = 185125333155840.
The previous prime is 213425024414011. The next prime is 213425024414053. The reversal of 213425024414041 is 140414420524312.
It is a happy number.
It is not a de Polignac number, because 213425024414041 - 25 = 213425024414009 is a prime.
It is a super-2 number, since 2×2134250244140412 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213425024414011) 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, 179391555 + ... + 180577351.
It is an arithmetic number, because the mean of its divisors is an integer number (7611101381304).
Almost surely, 2213425024414041 is an apocalyptic number.
It is an amenable number.
213425024414041 is a deficient number, since it is larger than the sum of its proper divisors (30130219787687).
213425024414041 is a wasteful number, since it uses less digits than its factorization.
213425024414041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1187601.
The product of its (nonzero) digits is 122880, while the sum is 37.
Adding to 213425024414041 its reverse (140414420524312), we get a palindrome (353839444938353).
The spelling of 213425024414041 in words is "two hundred thirteen trillion, four hundred twenty-five billion, twenty-four million, four hundred fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •