Base | Representation |
---|---|
bin | 1000100110010010111010000… |
… | …1101011001001000111011001 |
3 | 2221100022210220000011202001010 |
4 | 2021210232201223021013121 |
5 | 1113301220124421442210 |
6 | 5542502554522444133 |
7 | 241305604301343000 |
oct | 21144564153110731 |
9 | 2840283800152033 |
10 | 605056230265305 |
11 | 1658759a7224045 |
12 | 57a3bb4b363649 |
13 | 1cc7c73332c610 |
14 | a95ac40973c37 |
15 | 49e3d7b203920 |
hex | 2264ba1ac91d9 |
605056230265305 has 64 divisors (see below), whose sum is σ = 1215811577433600. Its totient is φ = 255320431204608.
The previous prime is 605056230265247. The next prime is 605056230265327. The reversal of 605056230265305 is 503562032650506.
It is not a de Polignac number, because 605056230265305 - 29 = 605056230264793 is a prime.
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 63 ways as a sum of consecutive naturals, for example, 4523041662 + ... + 4523175431.
It is an arithmetic number, because the mean of its divisors is an integer number (18997055897400).
Almost surely, 2605056230265305 is an apocalyptic number.
605056230265305 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
605056230265305 is an abundant number, since it is smaller than the sum of its proper divisors (610755347168295).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
605056230265305 is a wasteful number, since it uses less digits than its factorization.
605056230265305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9046217135 (or 9046217121 counting only the distinct ones).
The product of its (nonzero) digits is 4860000, while the sum is 48.
The spelling of 605056230265305 in words is "six hundred five trillion, fifty-six billion, two hundred thirty million, two hundred sixty-five thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •