Base | Representation |
---|---|
bin | 111000111101101001… |
… | …000100110100100001 |
3 | 12211212121022220102211 |
4 | 320331221010310201 |
5 | 2000230403014334 |
6 | 44033114442121 |
7 | 4263460020202 |
oct | 707551046441 |
9 | 184777286384 |
10 | 61163719969 |
11 | 23a37364100 |
12 | ba2b733341 |
13 | 59c988b0a1 |
14 | 2d6325b5a9 |
15 | 18ce9c3a64 |
hex | e3da44d21 |
61163719969 has 9 divisors (see below), whose sum is σ = 67232533809. Its totient is φ = 55600908660.
The previous prime is 61163719963. The next prime is 61163719973. The reversal of 61163719969 is 96991736116.
The square root of 61163719969 is 247313.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 61163719969 - 217 = 61163588897 is a prime.
It is a super-3 number, since 3×611637199693 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (61163719963) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 2709202 + ... + 2731684.
Almost surely, 261163719969 is an apocalyptic number.
61163719969 is the 247313-rd square number.
61163719969 is the 123657-th centered octagonal number.
It is an amenable number.
61163719969 is a deficient number, since it is larger than the sum of its proper divisors (6068813840).
61163719969 is an frugal number, since it uses more digits than its factorization.
61163719969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44988 (or 22494 counting only the distinct ones).
The product of its digits is 3306744, while the sum is 58.
The spelling of 61163719969 in words is "sixty-one billion, one hundred sixty-three million, seven hundred nineteen thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •