Base | Representation |
---|---|
bin | 10010011011010011100000… |
… | …00011000001001100110000 |
3 | 12022110201202101010201001111 |
4 | 21031221300003001030300 |
5 | 20302342142413410000 |
6 | 222102523545043104 |
7 | 11351342163133360 |
oct | 1115516003011460 |
9 | 168421671121044 |
10 | 40520601310000 |
11 | 11a027660846a9 |
12 | 46651b7486494 |
13 | 197c0cb8570a6 |
14 | a012c97cc9a0 |
15 | 4a4079296cba |
hex | 24da700c1330 |
40520601310000 has 100 divisors (see below), whose sum is σ = 112119346286992. Its totient is φ = 13892777568000.
The previous prime is 40520601309977. The next prime is 40520601310037. The reversal of 40520601310000 is 1310602504.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×405206013100002 (a number of 28 digits) contains 22 as substring.
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 19 ways as a sum of consecutive naturals, for example, 289362867 + ... + 289502866.
Almost surely, 240520601310000 is an apocalyptic number.
40520601310000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
40520601310000 is an abundant number, since it is smaller than the sum of its proper divisors (71598744976992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40520601310000 is an equidigital number, since it uses as much as digits as its factorization.
40520601310000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 578865768 (or 578865747 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 40520601310000 its reverse (1310602504), we get a palindrome (40521911912504).
The spelling of 40520601310000 in words is "forty trillion, five hundred twenty billion, six hundred one million, three hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •