Base | Representation |
---|---|
bin | 101110110110001101000100… |
… | …001100100100001011111111 |
3 | 1000000111202101211001020012212 |
4 | 232312031010030210023333 |
5 | 204001134210144113210 |
6 | 2010111103123051035 |
7 | 61253352605424041 |
oct | 5666150414441377 |
9 | 1000452354036185 |
10 | 206035020301055 |
11 | 5a715a63702270 |
12 | 1b136b73510a7b |
13 | 8ac7032accaba |
14 | 38c42108c5a91 |
15 | 18c469c767805 |
hex | bb63443242ff |
206035020301055 has 32 divisors (see below), whose sum is σ = 269930243294208. Its totient is φ = 149726101968000.
The previous prime is 206035020300983. The next prime is 206035020301127. The reversal of 206035020301055 is 550103020530602.
It is an interprime number because it is at equal distance from previous prime (206035020300983) and next prime (206035020301127).
It is not a de Polignac number, because 206035020301055 - 214 = 206035020284671 is a prime.
It is a super-2 number, since 2×2060350203010552 (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 31 ways as a sum of consecutive naturals, for example, 361381244 + ... + 361950926.
It is an arithmetic number, because the mean of its divisors is an integer number (8435320102944).
Almost surely, 2206035020301055 is an apocalyptic number.
206035020301055 is a deficient number, since it is larger than the sum of its proper divisors (63895222993153).
206035020301055 is a wasteful number, since it uses less digits than its factorization.
206035020301055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 574847.
The product of its (nonzero) digits is 27000, while the sum is 32.
Adding to 206035020301055 its reverse (550103020530602), we get a palindrome (756138040831657).
The spelling of 206035020301055 in words is "two hundred six trillion, thirty-five billion, twenty million, three hundred one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •