Base | Representation |
---|---|
bin | 101111110001111000… |
… | …1000101011010000001 |
3 | 100210211202102122100211 |
4 | 1133203301011122001 |
5 | 3140114004334131 |
6 | 115045240514121 |
7 | 10261442503621 |
oct | 1374361053201 |
9 | 323752378324 |
10 | 102605543041 |
11 | 3a573177161 |
12 | 17a7647b941 |
13 | 98a25736a1 |
14 | 4d75106881 |
15 | 2a07d625b1 |
hex | 17e3c45681 |
102605543041 has 27 divisors (see below), whose sum is σ = 113357679939. Its totient is φ = 92852088912.
The previous prime is 102605543039. The next prime is 102605543081. The reversal of 102605543041 is 140345506201.
It is a happy number.
The square root of 102605543041 is 320321.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 100378080625 + 2227462416 = 316825^2 + 47196^2 .
It is not a de Polignac number, because 102605543041 - 21 = 102605543039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102605542994 and 102605543012.
It is not an unprimeable number, because it can be changed into a prime (102605543011) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 139979911 + ... + 139980643.
Almost surely, 2102605543041 is an apocalyptic number.
102605543041 is the 320321-st square number.
102605543041 is the 160161-st centered octagonal number.
It is an amenable number.
102605543041 is a deficient number, since it is larger than the sum of its proper divisors (10752136898).
102605543041 is an frugal number, since it uses more digits than its factorization.
102605543041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1550 (or 775 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 31.
The spelling of 102605543041 in words is "one hundred two billion, six hundred five million, five hundred forty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •