Base | Representation |
---|---|
bin | 100000000011110111011010… |
… | …000100111000101000111000 |
3 | 200111020202202021021020212202 |
4 | 200003313122010320220320 |
5 | 121440143412324332130 |
6 | 1215515540500125332 |
7 | 41462066154156656 |
oct | 4003673204705070 |
9 | 614222667236782 |
10 | 141003140074040 |
11 | 40a2310669a252 |
12 | 1399342a396848 |
13 | 608a7013c56ca |
14 | 26b683479ddd6 |
15 | 1147c36765145 |
hex | 803dda138a38 |
141003140074040 has 128 divisors (see below), whose sum is σ = 321337373616000. Its totient is φ = 55678929666048.
The previous prime is 141003140074037. The next prime is 141003140074061. The reversal of 141003140074040 is 40470041300141.
It is a junction number, because it is equal to n+sod(n) for n = 141003140073994 and 141003140074012.
It is a congruent number.
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, 3699006101 + ... + 3699044219.
It is an arithmetic number, because the mean of its divisors is an integer number (2510448231375).
Almost surely, 2141003140074040 is an apocalyptic number.
141003140074040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141003140074040 is an abundant number, since it is smaller than the sum of its proper divisors (180334233541960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141003140074040 is a wasteful number, since it uses less digits than its factorization.
141003140074040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40609 (or 40605 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 29.
Adding to 141003140074040 its reverse (40470041300141), we get a palindrome (181473181374181).
The spelling of 141003140074040 in words is "one hundred forty-one trillion, three billion, one hundred forty million, seventy-four thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •