Base | Representation |
---|---|
bin | 10011000101011111110101… |
… | …01010010010110110100000 |
3 | 12111121022202112000101201120 |
4 | 21202233322222102312200 |
5 | 21000120214143343410 |
6 | 225132523120132240 |
7 | 11561153631621330 |
oct | 1142577252226640 |
9 | 174538675011646 |
10 | 41970330840480 |
11 | 12411576660209 |
12 | 485a16aa67080 |
13 | 1a55a29172233 |
14 | a515368410c0 |
15 | 4cbb28172570 |
hex | 262bfaa92da0 |
41970330840480 has 192 divisors, whose sum is σ = 151100893456128. Its totient is φ = 9592729436160.
The previous prime is 41970330840467. The next prime is 41970330840511. The reversal of 41970330840480 is 8404803307914.
41970330840480 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67768704 + ... + 68385216.
It is an arithmetic number, because the mean of its divisors is an integer number (786983820084).
Almost surely, 241970330840480 is an apocalyptic number.
41970330840480 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
41970330840480 is an abundant number, since it is smaller than the sum of its proper divisors (109130562615648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41970330840480 is a wasteful number, since it uses less digits than its factorization.
41970330840480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 636799 (or 636791 counting only the distinct ones).
The product of its (nonzero) digits is 2322432, while the sum is 51.
The spelling of 41970330840480 in words is "forty-one trillion, nine hundred seventy billion, three hundred thirty million, eight hundred forty thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •