Base | Representation |
---|---|
bin | 101111111111100110… |
… | …1101111010011100001 |
3 | 100212000211221021210000 |
4 | 1133333031233103201 |
5 | 3142034401231041 |
6 | 115203050530213 |
7 | 10306033611144 |
oct | 1377715572341 |
9 | 325024837700 |
10 | 103066039521 |
11 | 3a78a101a65 |
12 | 17b84736969 |
13 | 9946aa6c03 |
14 | 4dba33805b |
15 | 2a334c5bb6 |
hex | 17ff36f4e1 |
103066039521 has 15 divisors (see below), whose sum is σ = 153967165473. Its totient is φ = 68708766780.
The previous prime is 103066039513. The next prime is 103066039523. The reversal of 103066039521 is 125930660301.
The square root of 103066039521 is 321039.
It is a perfect power (a square), and thus also a powerful number.
103066039521 is a `hidden beast` number, since 10 + 30 + 6 + 60 + 39 + 521 = 666.
It is not a de Polignac number, because 103066039521 - 23 = 103066039513 is a prime.
It is not an unprimeable number, because it can be changed into a prime (103066039523) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 2871516 + ... + 2907186.
Almost surely, 2103066039521 is an apocalyptic number.
103066039521 is the 321039-th square number.
103066039521 is the 160520-th centered octagonal number.
It is an amenable number.
103066039521 is a deficient number, since it is larger than the sum of its proper divisors (50901125952).
103066039521 is an frugal number, since it uses more digits than its factorization.
103066039521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71354 (or 35674 counting only the distinct ones).
The product of its (nonzero) digits is 29160, while the sum is 36.
Multiplying 103066039521 by its sum of digits (36), we get a square (3710377422756 = 19262342).
Adding to 103066039521 its reverse (125930660301), we get a palindrome (228996699822).
The spelling of 103066039521 in words is "one hundred three billion, sixty-six million, thirty-nine thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •