Base | Representation |
---|---|
bin | 1100100000000… |
… | …01001100010001 |
3 | 21022022120021121 |
4 | 12100001030101 |
5 | 203321044411 |
6 | 14223322241 |
7 | 2412213343 |
oct | 620011421 |
9 | 238276247 |
10 | 104862481 |
11 | 54212809 |
12 | 2b150381 |
13 | 18956b09 |
14 | dcd9293 |
15 | 9315571 |
hex | 6401311 |
104862481 has 4 divisors (see below), whose sum is σ = 104975332. Its totient is φ = 104749632.
The previous prime is 104862427. The next prime is 104862523. The reversal of 104862481 is 184268401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 184268401 = 2237 ⋅82373.
It can be written as a sum of positive squares in 2 ways, for example, as 54523456 + 50339025 = 7384^2 + 7095^2 .
It is a cyclic number.
It is not a de Polignac number, because 104862481 - 27 = 104862353 is a prime.
It is a super-2 number, since 2×1048624812 = 21992279842950722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104862421) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55020 + ... + 56893.
It is an arithmetic number, because the mean of its divisors is an integer number (26243833).
Almost surely, 2104862481 is an apocalyptic number.
It is an amenable number.
104862481 is a deficient number, since it is larger than the sum of its proper divisors (112851).
104862481 is an equidigital number, since it uses as much as digits as its factorization.
104862481 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112850.
The product of its (nonzero) digits is 12288, while the sum is 34.
The square root of 104862481 is about 10240.2383273047. The cubic root of 104862481 is about 471.5633485084.
The spelling of 104862481 in words is "one hundred four million, eight hundred sixty-two thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •