Base | Representation |
---|---|
bin | 101100010111010100011… |
… | …1100011111011010111111 |
3 | 210120220102210200201112110 |
4 | 1120232220330133122333 |
5 | 1244344430103211110 |
6 | 20545034221305103 |
7 | 1166344040355504 |
oct | 130565074373277 |
9 | 23526383621473 |
10 | 6097393022655 |
11 | 1a40987447920 |
12 | 825870705193 |
13 | 352c9ba2579c |
14 | 1711889134ab |
15 | a89193b4a20 |
hex | 58ba8f1f6bf |
6097393022655 has 192 divisors, whose sum is σ = 11646183628800. Its totient is φ = 2693918649600.
The previous prime is 6097393022639. The next prime is 6097393022659. The reversal of 6097393022655 is 5562203937906.
6097393022655 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 6097393022655 - 24 = 6097393022639 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a junction number, because it is equal to n+sod(n) for n = 6097393022595 and 6097393022604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6097393022659) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 503120686 + ... + 503132804.
It is an arithmetic number, because the mean of its divisors is an integer number (60657206400).
Almost surely, 26097393022655 is an apocalyptic number.
6097393022655 is a deficient number, since it is larger than the sum of its proper divisors (5548790606145).
6097393022655 is a wasteful number, since it uses less digits than its factorization.
6097393022655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12386 (or 12355 counting only the distinct ones).
The product of its (nonzero) digits is 18370800, while the sum is 57.
The spelling of 6097393022655 in words is "six trillion, ninety-seven billion, three hundred ninety-three million, twenty-two thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •