Base | Representation |
---|---|
bin | 101110101010001111000010… |
… | …110101111001001100101101 |
3 | 222220121010100202022222010002 |
4 | 232222033002311321030231 |
5 | 203344200210400442110 |
6 | 2004241154245354045 |
7 | 61140054222560546 |
oct | 5652170265711455 |
9 | 886533322288102 |
10 | 205212511343405 |
11 | 5a429156857535 |
12 | 1b023686a08925 |
13 | 8a675c2731097 |
14 | 38964a4d754cd |
15 | 18ad0ad30eaa5 |
hex | baa3c2d7932d |
205212511343405 has 8 divisors (see below), whose sum is σ = 247046830377984. Its totient is φ = 163642131230800.
The previous prime is 205212511343393. The next prime is 205212511343419. The reversal of 205212511343405 is 504343115212502.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 205212511343405 - 226 = 205212444234541 is a prime.
It is a super-2 number, since 2×2052125113434052 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
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, 65984728781 + ... + 65984731890.
It is an arithmetic number, because the mean of its divisors is an integer number (30880853797248).
Almost surely, 2205212511343405 is an apocalyptic number.
It is an amenable number.
205212511343405 is a deficient number, since it is larger than the sum of its proper divisors (41834319034579).
205212511343405 is a wasteful number, since it uses less digits than its factorization.
205212511343405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131969460987.
The product of its (nonzero) digits is 144000, while the sum is 38.
Adding to 205212511343405 its reverse (504343115212502), we get a palindrome (709555626555907).
The spelling of 205212511343405 in words is "two hundred five trillion, two hundred twelve billion, five hundred eleven million, three hundred forty-three thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •