Base | Representation |
---|---|
bin | 100110101011011001… |
… | …0100101110001111001 |
3 | 21221101121221121212111 |
4 | 1031112302211301321 |
5 | 2330101440344040 |
6 | 102054002212321 |
7 | 6000213304105 |
oct | 1152662456171 |
9 | 257347847774 |
10 | 83060481145 |
11 | 32253526944 |
12 | 141209540a1 |
13 | 7aa92042c5 |
14 | 403d406905 |
15 | 226200cdea |
hex | 1356ca5c79 |
83060481145 has 8 divisors (see below), whose sum is σ = 99840662856. Its totient is φ = 66336327936.
The previous prime is 83060481143. The next prime is 83060481193. The reversal of 83060481145 is 54118406038.
It can be written as a sum of positive squares in 4 ways, for example, as 413430889 + 82647050256 = 20333^2 + 287484^2 .
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 83060481145 - 21 = 83060481143 is a prime.
It is a super-2 number, since 2×830604811452 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 83060481098 and 83060481107.
It is not an unprimeable number, because it can be changed into a prime (83060481143) 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, 14003862 + ... + 14009791.
It is an arithmetic number, because the mean of its divisors is an integer number (12480082857).
Almost surely, 283060481145 is an apocalyptic number.
It is an amenable number.
83060481145 is a deficient number, since it is larger than the sum of its proper divisors (16780181711).
83060481145 is a wasteful number, since it uses less digits than its factorization.
83060481145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28014251.
The product of its (nonzero) digits is 92160, while the sum is 40.
The spelling of 83060481145 in words is "eighty-three billion, sixty million, four hundred eighty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •