Base | Representation |
---|---|
bin | 10111110011000101101111… |
… | …010110101001011100000000 |
3 | 111201120222001100201111001101 |
4 | 113303011233112221130000 |
5 | 102204321304104302341 |
6 | 1010334510203144144 |
7 | 31021602136630600 |
oct | 2763055726513400 |
9 | 451528040644041 |
10 | 104665926244096 |
11 | 3039362a803298 |
12 | b8a4b5ab15054 |
13 | 4652c5403c869 |
14 | 1bbbc01d78c00 |
15 | c17903264831 |
hex | 5f316f5a9700 |
104665926244096 has 108 divisors (see below), whose sum is σ = 249601336258008. Its totient is φ = 43644478703616.
The previous prime is 104665926244091. The next prime is 104665926244097. The reversal of 104665926244096 is 690442629566401.
It is a super-2 number, since 2×1046659262440962 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (64).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104665926244091) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 112291326 + ... + 113219581.
Almost surely, 2104665926244096 is an apocalyptic number.
104665926244096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
104665926244096 is an abundant number, since it is smaller than the sum of its proper divisors (144935410013912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104665926244096 is an equidigital number, since it uses as much as digits as its factorization.
104665926244096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 225510974 (or 225510953 counting only the distinct ones).
The product of its (nonzero) digits is 134369280, while the sum is 64.
The spelling of 104665926244096 in words is "one hundred four trillion, six hundred sixty-five billion, nine hundred twenty-six million, two hundred forty-four thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •