Base | Representation |
---|---|
bin | 11100001000101000011000… |
… | …00000010110010000101001 |
3 | 22010001122020021222000200210 |
4 | 32010110030000112100221 |
5 | 31102131113030113044 |
6 | 335330153123251333 |
7 | 16013621404115163 |
oct | 1604241400262051 |
9 | 263048207860623 |
10 | 61869205316649 |
11 | 18793645524465 |
12 | 6b327bb819b49 |
13 | 286a3196ca0b3 |
14 | 113c6b2377933 |
15 | 7245600951b9 |
hex | 38450c016429 |
61869205316649 has 8 divisors (see below), whose sum is σ = 84247428516480. Its totient is φ = 40368559497296.
The previous prime is 61869205316647. The next prime is 61869205316663. The reversal of 61869205316649 is 94661350296816.
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 61869205316649 - 21 = 61869205316647 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 61869205316649.
It is not an unprimeable number, because it can be changed into a prime (61869205316647) 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, 219394344954 + ... + 219394345235.
It is an arithmetic number, because the mean of its divisors is an integer number (10530928564560).
Almost surely, 261869205316649 is an apocalyptic number.
It is an amenable number.
61869205316649 is a deficient number, since it is larger than the sum of its proper divisors (22378223199831).
61869205316649 is a wasteful number, since it uses less digits than its factorization.
61869205316649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 438788690239.
The product of its (nonzero) digits is 100776960, while the sum is 66.
The spelling of 61869205316649 in words is "sixty-one trillion, eight hundred sixty-nine billion, two hundred five million, three hundred sixteen thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •