Base | Representation |
---|---|
bin | 10100001011000001111… |
… | …01110101100010110100 |
3 | 2110021001111002021202211 |
4 | 22011200331311202310 |
5 | 42324000314314432 |
6 | 1250225141143204 |
7 | 101035034350012 |
oct | 12054075654264 |
9 | 2407044067684 |
10 | 693116557492 |
11 | 247a49255437 |
12 | b23b73bab04 |
13 | 5048c354038 |
14 | 257930498b2 |
15 | 13069b13d47 |
hex | a160f758b4 |
693116557492 has 12 divisors (see below), whose sum is σ = 1254779974980. Its totient is φ = 334607993216.
The previous prime is 693116557489. The next prime is 693116557513. The reversal of 693116557492 is 294755611396.
It can be written as a sum of positive squares in 2 ways, for example, as 121888963876 + 571227593616 = 349126^2 + 755796^2 .
It is a Harshad number since it is a multiple of its sum of digits (58).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2987571253 + ... + 2987571484.
It is an arithmetic number, because the mean of its divisors is an integer number (104564997915).
Almost surely, 2693116557492 is an apocalyptic number.
It is an amenable number.
693116557492 is a deficient number, since it is larger than the sum of its proper divisors (561663417488).
693116557492 is a wasteful number, since it uses less digits than its factorization.
693116557492 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5975142770 (or 5975142768 counting only the distinct ones).
The product of its digits is 12247200, while the sum is 58.
The spelling of 693116557492 in words is "six hundred ninety-three billion, one hundred sixteen million, five hundred fifty-seven thousand, four hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •