Base | Representation |
---|---|
bin | 111011101110001101110… |
… | …111111001110110111100 |
3 | 112112100022222022012022202 |
4 | 323232031313321312330 |
5 | 1014220120421310134 |
6 | 12421215141131032 |
7 | 602336531332661 |
oct | 73561567716674 |
9 | 15470288265282 |
10 | 4104074010044 |
11 | 1342589870818 |
12 | 5634920b9a78 |
13 | 23a0216706b8 |
14 | 1028d149ba68 |
15 | 71b52bd8d7e |
hex | 3bb8ddf9dbc |
4104074010044 has 12 divisors (see below), whose sum is σ = 7299869346168. Its totient is φ = 2018397054000.
The previous prime is 4104074010041. The next prime is 4104074010053. The reversal of 4104074010044 is 4400104704014.
It is a super-2 number, since 2×41040740100442 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4104074009989 and 4104074010016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4104074010041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8409987482 + ... + 8409987969.
It is an arithmetic number, because the mean of its divisors is an integer number (608322445514).
Almost surely, 24104074010044 is an apocalyptic number.
It is an amenable number.
4104074010044 is a deficient number, since it is larger than the sum of its proper divisors (3195795336124).
4104074010044 is a wasteful number, since it uses less digits than its factorization.
4104074010044 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16819975516 (or 16819975514 counting only the distinct ones).
The product of its (nonzero) digits is 7168, while the sum is 29.
Adding to 4104074010044 its reverse (4400104704014), we get a palindrome (8504178714058).
The spelling of 4104074010044 in words is "four trillion, one hundred four billion, seventy-four million, ten thousand, forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •