Base | Representation |
---|---|
bin | 10011100111100100110100… |
… | …10010010001000111101000 |
3 | 12122202021002012011202002202 |
4 | 21303302122102101013220 |
5 | 21123311224420013000 |
6 | 231430451223115332 |
7 | 12041565100356311 |
oct | 1163623222210750 |
9 | 178667065152082 |
10 | 43141240001000 |
11 | 12823108321aa9 |
12 | 4a09089ba2b48 |
13 | 1b0c280847c4b |
14 | a92093583608 |
15 | 4ec308e6edd5 |
hex | 273c9a4911e8 |
43141240001000 has 128 divisors (see below), whose sum is σ = 110883847276800. Its totient is φ = 15637465324800.
The previous prime is 43141240000997. The next prime is 43141240001063. The reversal of 43141240001000 is 10004214134.
It is a super-2 number, since 2×431412400010002 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
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, 48923687 + ... + 49797686.
It is an arithmetic number, because the mean of its divisors is an integer number (866280056850).
Almost surely, 243141240001000 is an apocalyptic number.
43141240001000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
43141240001000 is an abundant number, since it is smaller than the sum of its proper divisors (67742607275800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
43141240001000 is a wasteful number, since it uses less digits than its factorization.
43141240001000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98721436 (or 98721422 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 43141240001000 its reverse (10004214134), we get a palindrome (43151244215134).
The spelling of 43141240001000 in words is "forty-three trillion, one hundred forty-one billion, two hundred forty million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •