Base | Representation |
---|---|
bin | 110101110101111101010… |
… | …111001100011010111001 |
3 | 111002201112020121210200220 |
4 | 311311331113030122321 |
5 | 441110220414332131 |
6 | 11511442210450253 |
7 | 531215120463105 |
oct | 65657527143271 |
9 | 14081466553626 |
10 | 3700070074041 |
11 | 11a7211107000 |
12 | 4b9121b93989 |
13 | 20abb8663273 |
14 | cb12763c905 |
15 | 663a9a3de96 |
hex | 35d7d5cc6b9 |
3700070074041 has 96 divisors (see below), whose sum is σ = 5590658174976. Its totient is φ = 2176531156800.
The previous prime is 3700070074037. The next prime is 3700070074049. The reversal of 3700070074041 is 1404700700073.
3700070074041 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3700070074041 - 22 = 3700070074037 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3700070073993 and 3700070074011.
It is not an unprimeable number, because it can be changed into a prime (3700070074049) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 4061547376 + ... + 4061548286.
It is an arithmetic number, because the mean of its divisors is an integer number (58236022656).
Almost surely, 23700070074041 is an apocalyptic number.
It is an amenable number.
3700070074041 is a deficient number, since it is larger than the sum of its proper divisors (1890588100935).
3700070074041 is an equidigital number, since it uses as much as digits as its factorization.
3700070074041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1764 (or 1705 counting only the distinct ones).
The product of its (nonzero) digits is 16464, while the sum is 33.
The spelling of 3700070074041 in words is "three trillion, seven hundred billion, seventy million, seventy-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •