Base | Representation |
---|---|
bin | 10010110110100001… |
… | …100110100011000100 |
3 | 1221020201010210201202 |
4 | 102312201212203010 |
5 | 312423441144030 |
6 | 13144335042032 |
7 | 1314422163410 |
oct | 226641464304 |
9 | 57221123652 |
10 | 20242131140 |
11 | 8648178800 |
12 | 3b0b070318 |
13 | 1ba78c37ba |
14 | da0513d40 |
15 | 7d7148745 |
hex | 4b68668c4 |
20242131140 has 144 divisors (see below), whose sum is σ = 53932338432. Its totient is φ = 6246240000.
The previous prime is 20242131131. The next prime is 20242131209. The reversal of 20242131140 is 4113124202.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1705025 + ... + 1716855.
It is an arithmetic number, because the mean of its divisors is an integer number (374530128).
Almost surely, 220242131140 is an apocalyptic number.
20242131140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20242131140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26966169216).
20242131140 is an abundant number, since it is smaller than the sum of its proper divisors (33690207292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20242131140 is a wasteful number, since it uses less digits than its factorization.
20242131140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11970 (or 11957 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 20242131140 its reverse (4113124202), we get a palindrome (24355255342).
The spelling of 20242131140 in words is "twenty billion, two hundred forty-two million, one hundred thirty-one thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •