Base | Representation |
---|---|
bin | 111100010010110001001… |
… | …000011010001100110000 |
3 | 112200002122010000111121212 |
4 | 330102301020122030300 |
5 | 1020341004440320130 |
6 | 12451225352135252 |
7 | 605226223664114 |
oct | 74226110321460 |
9 | 15602563014555 |
10 | 4143320245040 |
11 | 1358199297a79 |
12 | 56b005697528 |
13 | 24093750a862 |
14 | 1047758d7744 |
15 | 72b9d42ce95 |
hex | 3c4b121a330 |
4143320245040 has 80 divisors (see below), whose sum is σ = 10241716863168. Its totient is φ = 1555359556608.
The previous prime is 4143320245037. The next prime is 4143320245133. The reversal of 4143320245040 is 405420233414.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 4143320244988 and 4143320245006.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21145919 + ... + 21340958.
Almost surely, 24143320245040 is an apocalyptic number.
4143320245040 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4143320245040 is an abundant number, since it is smaller than the sum of its proper divisors (6098396618128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4143320245040 is a wasteful number, since it uses less digits than its factorization.
4143320245040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42486966 (or 42486960 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 32.
Adding to 4143320245040 its reverse (405420233414), we get a palindrome (4548740478454).
The spelling of 4143320245040 in words is "four trillion, one hundred forty-three billion, three hundred twenty million, two hundred forty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •