Base | Representation |
---|---|
bin | 111010100000000001011… |
… | …010111100100100111100 |
3 | 112020022121121021122201210 |
4 | 322200001122330210330 |
5 | 1011331142441331030 |
6 | 12314451534204420 |
7 | 563305103434050 |
oct | 72400132744474 |
9 | 15208547248653 |
10 | 4020113230140 |
11 | 130aa14129117 |
12 | 54b15b953710 |
13 | 232130a99a47 |
14 | dc80869bc60 |
15 | 6e88bb40bb0 |
hex | 3a8016bc93c |
4020113230140 has 96 divisors (see below), whose sum is σ = 13279341809664. Its totient is φ = 889241633280.
The previous prime is 4020113230139. The next prime is 4020113230163. The reversal of 4020113230140 is 410323110204.
It is a super-2 number, since 2×40201132301402 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 154369209 + ... + 154395248.
It is an arithmetic number, because the mean of its divisors is an integer number (138326477184).
Almost surely, 24020113230140 is an apocalyptic number.
It is an amenable number.
4020113230140 is an abundant number, since it is smaller than the sum of its proper divisors (9259228579524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4020113230140 is a wasteful number, since it uses less digits than its factorization.
4020113230140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 308764507 (or 308764505 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 4020113230140 its reverse (410323110204), we get a palindrome (4430436340344).
The spelling of 4020113230140 in words is "four trillion, twenty billion, one hundred thirteen million, two hundred thirty thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •