Base | Representation |
---|---|
bin | 1011110010110010110… |
… | …0111110100100101111 |
3 | 201100222110221202100221 |
4 | 2330230230332210233 |
5 | 11304423020413210 |
6 | 233025045232211 |
7 | 20431643626561 |
oct | 2745454764457 |
9 | 640873852327 |
10 | 202613451055 |
11 | 78a23013704 |
12 | 33326a02667 |
13 | 1614c8c1712 |
14 | 9b41225331 |
15 | 540cb101da |
hex | 2f2cb3e92f |
202613451055 has 8 divisors (see below), whose sum is σ = 255932780400. Its totient is φ = 153559668096.
The previous prime is 202613450989. The next prime is 202613451097. The reversal of 202613451055 is 550154316202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 202613451055 - 217 = 202613319983 is a prime.
It is a super-2 number, since 2×2026134510552 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 202613451055.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1066386490 + ... + 1066386679.
It is an arithmetic number, because the mean of its divisors is an integer number (31991597550).
Almost surely, 2202613451055 is an apocalyptic number.
202613451055 is a deficient number, since it is larger than the sum of its proper divisors (53319329345).
202613451055 is a wasteful number, since it uses less digits than its factorization.
202613451055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2132773193.
The product of its (nonzero) digits is 36000, while the sum is 34.
Adding to 202613451055 its reverse (550154316202), we get a palindrome (752767767257).
The spelling of 202613451055 in words is "two hundred two billion, six hundred thirteen million, four hundred fifty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •