Base | Representation |
---|---|
bin | 111011101101010000011… |
… | …011011010001010111000 |
3 | 112112020200010112001210212 |
4 | 323231100123122022320 |
5 | 1014211013020130130 |
6 | 12420524553530252 |
7 | 602302143106631 |
oct | 73552033321270 |
9 | 15466603461725 |
10 | 4103043130040 |
11 | 13420aa976378 |
12 | 563244a13988 |
13 | 239bb8c10b2a |
14 | 1028345d2888 |
15 | 71ae2457e95 |
hex | 3bb506da2b8 |
4103043130040 has 32 divisors (see below), whose sum is σ = 9234329724000. Its totient is φ = 1640775886464.
The previous prime is 4103043129959. The next prime is 4103043130049. The reversal of 4103043130040 is 400313403014.
It is a junction number, because it is equal to n+sod(n) for n = 4103043129988 and 4103043130015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4103043130049) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13642055 + ... + 13939574.
It is an arithmetic number, because the mean of its divisors is an integer number (288572803875).
Almost surely, 24103043130040 is an apocalyptic number.
4103043130040 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4103043130040 is an abundant number, since it is smaller than the sum of its proper divisors (5131286593960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4103043130040 is a wasteful number, since it uses less digits than its factorization.
4103043130040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27585359 (or 27585355 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 4103043130040 its reverse (400313403014), we get a palindrome (4503356533054).
The spelling of 4103043130040 in words is "four trillion, one hundred three billion, forty-three million, one hundred thirty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.044 sec. • engine limits •