Base | Representation |
---|---|
bin | 100010010001101000010… |
… | …111101001001011011111 |
3 | 22100011200101200020211222 |
4 | 202101220113221023133 |
5 | 302042321113403110 |
6 | 5002015212403555 |
7 | 332112560032241 |
oct | 42215027511337 |
9 | 8304611606758 |
10 | 2355393106655 |
11 | 828a0a004a76 |
12 | 3205a84765bb |
13 | 14116055b364 |
14 | 820046b2091 |
15 | 41408738c55 |
hex | 224685e92df |
2355393106655 has 8 divisors (see below), whose sum is σ = 2975233398000. Its totient is φ = 1785140038656.
The previous prime is 2355393106477. The next prime is 2355393106657. The reversal of 2355393106655 is 5566013935532.
2355393106655 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2355393106655 - 228 = 2355124671199 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2355393106597 and 2355393106606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2355393106657) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12396805730 + ... + 12396805919.
It is an arithmetic number, because the mean of its divisors is an integer number (371904174750).
Almost surely, 22355393106655 is an apocalyptic number.
2355393106655 is a deficient number, since it is larger than the sum of its proper divisors (619840291345).
2355393106655 is a wasteful number, since it uses less digits than its factorization.
2355393106655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24793611673.
The product of its (nonzero) digits is 10935000, while the sum is 53.
The spelling of 2355393106655 in words is "two trillion, three hundred fifty-five billion, three hundred ninety-three million, one hundred six thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •