Base | Representation |
---|---|
bin | 1000110000010010010011111… |
… | …0111110001011111001100001 |
3 | 2222210012221202111210122102200 |
4 | 2030010210332332023321201 |
5 | 1121221204133231444400 |
6 | 10022113212534203413 |
7 | 243521333522145006 |
oct | 21404447676137141 |
9 | 2883187674718380 |
10 | 616041100656225 |
11 | 1693206221867a2 |
12 | 59114a861b3569 |
13 | 205985710c7a5a |
14 | ac1a7969c78ad |
15 | 4b349994e5b00 |
hex | 230493ef8be61 |
616041100656225 has 36 divisors (see below), whose sum is σ = 1103408052055296. Its totient is φ = 328552278467040.
The previous prime is 616041100656217. The next prime is 616041100656227. The reversal of 616041100656225 is 522656001140616.
616041100656225 is a `hidden beast` number, since 6 + 1 + 6 + 0 + 4 + 1 + 10 + 0 + 6 + 5 + 622 + 5 = 666.
616041100656225 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 616041100656225 - 23 = 616041100656217 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (616041100656227) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 12617304 + ... + 37299846.
Almost surely, 2616041100656225 is an apocalyptic number.
It is an amenable number.
616041100656225 is a deficient number, since it is larger than the sum of its proper divisors (487366951399071).
616041100656225 is a wasteful number, since it uses less digits than its factorization.
616041100656225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24793486 (or 24793478 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 45.
The spelling of 616041100656225 in words is "six hundred sixteen trillion, forty-one billion, one hundred million, six hundred fifty-six thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •