Base | Representation |
---|---|
bin | 110000011100010111001010… |
… | …110101011011010100011010 |
3 | 1000221100212212002112001122001 |
4 | 300130113022311123110122 |
5 | 210411144130431034432 |
6 | 2033044122215551214 |
7 | 62606506565060344 |
oct | 6034271265332432 |
9 | 1027325762461561 |
10 | 213055255721242 |
11 | 61982254574270 |
12 | 1ba8b65208b50a |
13 | 91b604180c42c |
14 | 3a87d023a6294 |
15 | 19970c96d69e7 |
hex | c1c5cad5b51a |
213055255721242 has 16 divisors (see below), whose sum is σ = 349094001636864. Its totient is φ = 96716040100000.
The previous prime is 213055255721239. The next prime is 213055255721257. The reversal of 213055255721242 is 242127552550312.
213055255721242 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2130552557212422 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 213055255721192 and 213055255721201.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6362880634 + ... + 6362914117.
It is an arithmetic number, because the mean of its divisors is an integer number (21818375102304).
Almost surely, 2213055255721242 is an apocalyptic number.
213055255721242 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
213055255721242 is a deficient number, since it is larger than the sum of its proper divisors (136038745915622).
213055255721242 is a wasteful number, since it uses less digits than its factorization.
213055255721242 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12725795525.
The product of its (nonzero) digits is 1680000, while the sum is 46.
The spelling of 213055255721242 in words is "two hundred thirteen trillion, fifty-five billion, two hundred fifty-five million, seven hundred twenty-one thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.167 sec. • engine limits •