Base | Representation |
---|---|
bin | 111011101000001100100… |
… | …110111000010011000000 |
3 | 112111201122111201200011122 |
4 | 323220030212320103000 |
5 | 1014113401220202130 |
6 | 12414225521531412 |
7 | 602020414013540 |
oct | 73501446702300 |
9 | 15451574650148 |
10 | 4097610319040 |
11 | 133a872223027 |
12 | 5621894a3b68 |
13 | 2395314c3374 |
14 | 10247ac69320 |
15 | 718c550b2e5 |
hex | 3ba0c9b84c0 |
4097610319040 has 224 divisors, whose sum is σ = 11873298193920. Its totient is φ = 1314865004544.
The previous prime is 4097610319027. The next prime is 4097610319097. The reversal of 4097610319040 is 409130167904.
It is a tau number, because it is divible by the number of its divisors (224).
It is a junction number, because it is equal to n+sod(n) for n = 4097610318982 and 4097610319000.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6515747 + ... + 7116893.
Almost surely, 24097610319040 is an apocalyptic number.
4097610319040 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4097610319040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5936649096960).
4097610319040 is an abundant number, since it is smaller than the sum of its proper divisors (7775687874880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4097610319040 is a wasteful number, since it uses less digits than its factorization.
4097610319040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 601367 (or 601357 counting only the distinct ones).
The product of its (nonzero) digits is 163296, while the sum is 44.
The spelling of 4097610319040 in words is "four trillion, ninety-seven billion, six hundred ten million, three hundred nineteen thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •