Base | Representation |
---|---|
bin | 110000101001001100… |
… | …0001100111100100001 |
3 | 100222122002100102101201 |
4 | 1201102120030330201 |
5 | 3202414042310142 |
6 | 115553332001201 |
7 | 10355435216446 |
oct | 1412230147441 |
9 | 328562312351 |
10 | 104461291297 |
11 | 40335748300 |
12 | 182b3a60201 |
13 | 9b09b8238c |
14 | 50ad7719cd |
15 | 2ab5c2dab7 |
hex | 185260cf21 |
104461291297 has 24 divisors (see below), whose sum is σ = 125767593000. Its totient is φ = 86296573440.
The previous prime is 104461291241. The next prime is 104461291309. The reversal of 104461291297 is 792192164401.
It can be written as a sum of positive squares in 4 ways, for example, as 22186400401 + 82274890896 = 148951^2 + 286836^2 .
It is not a de Polignac number, because 104461291297 - 231 = 102313807649 is a prime.
It is a super-2 number, since 2×1044612912972 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104461294297) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 815922 + ... + 935227.
It is an arithmetic number, because the mean of its divisors is an integer number (5240316375).
Almost surely, 2104461291297 is an apocalyptic number.
104461291297 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
104461291297 is a deficient number, since it is larger than the sum of its proper divisors (21306301703).
104461291297 is a wasteful number, since it uses less digits than its factorization.
104461291297 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1751217 (or 1751206 counting only the distinct ones).
The product of its (nonzero) digits is 217728, while the sum is 46.
The spelling of 104461291297 in words is "one hundred four billion, four hundred sixty-one million, two hundred ninety-one thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •