Base | Representation |
---|---|
bin | 10010111001100100110001… |
… | …001101011100000001111101 |
3 | 101220022022200020120100001002 |
4 | 102321210301031130001331 |
5 | 41343324434341421012 |
6 | 452441224421300045 |
7 | 23336213662516664 |
oct | 2271446115340175 |
9 | 356268606510032 |
10 | 83121327685757 |
11 | 24537614567999 |
12 | 93a5578564625 |
13 | 374c3cc958c4a |
14 | 167514527dddb |
15 | 99229a9917c2 |
hex | 4b993135c07d |
83121327685757 has 32 divisors (see below), whose sum is σ = 90499368960000. Its totient is φ = 76086647035776.
The previous prime is 83121327685741. The next prime is 83121327685793. The reversal of 83121327685757 is 75758672312138.
It is not a de Polignac number, because 83121327685757 - 24 = 83121327685741 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 83121327685693 and 83121327685702.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (83121327684757) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 651719969 + ... + 651847497.
It is an arithmetic number, because the mean of its divisors is an integer number (2828105280000).
Almost surely, 283121327685757 is an apocalyptic number.
It is an amenable number.
83121327685757 is a deficient number, since it is larger than the sum of its proper divisors (7378041274243).
83121327685757 is a wasteful number, since it uses less digits than its factorization.
83121327685757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136913.
The product of its digits is 118540800, while the sum is 65.
The spelling of 83121327685757 in words is "eighty-three trillion, one hundred twenty-one billion, three hundred twenty-seven million, six hundred eighty-five thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •