Base | Representation |
---|---|
bin | 1001001110010000011011… |
… | …0001000111010001110100 |
3 | 1022220102111001201012002222 |
4 | 2103210012301013101310 |
5 | 2312120302004332040 |
6 | 33322255031021512 |
7 | 2064425551032236 |
oct | 223440661072164 |
9 | 38812431635088 |
10 | 10140531324020 |
11 | 325a636629819 |
12 | 117937750a898 |
13 | 58732bb1c116 |
14 | 270b39148256 |
15 | 128ba2618bb5 |
hex | 93906c47474 |
10140531324020 has 24 divisors (see below), whose sum is σ = 21305876407200. Its totient is φ = 4054162886432.
The previous prime is 10140531323983. The next prime is 10140531324037. The reversal of 10140531324020 is 2042313504101.
It is a happy number.
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 7 ways as a sum of consecutive naturals, for example, 128062130 + ... + 128141289.
It is an arithmetic number, because the mean of its divisors is an integer number (887744850300).
Almost surely, 210140531324020 is an apocalyptic number.
10140531324020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10140531324020 is an abundant number, since it is smaller than the sum of its proper divisors (11165345083180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10140531324020 is a wasteful number, since it uses less digits than its factorization.
10140531324020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256205407 (or 256205405 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 10140531324020 its reverse (2042313504101), we get a palindrome (12182844828121).
The spelling of 10140531324020 in words is "ten trillion, one hundred forty billion, five hundred thirty-one million, three hundred twenty-four thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •