Base | Representation |
---|---|
bin | 10010101111111001… |
… | …110000010011010000 |
3 | 1220221222001212200121 |
4 | 102233321300103100 |
5 | 312212020201112 |
6 | 13125325400024 |
7 | 1311602602222 |
oct | 225771602320 |
9 | 56858055617 |
10 | 20131022032 |
11 | 85a04898a0 |
12 | 3a99a09014 |
13 | 1b8a890674 |
14 | d8d870412 |
15 | 7cc4ec407 |
hex | 4afe704d0 |
20131022032 has 40 divisors (see below), whose sum is σ = 42570712800. Its totient is φ = 9145937280.
The previous prime is 20131021979. The next prime is 20131022047. The reversal of 20131022032 is 23022013102.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 20131021997 and 20131022015.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 342178 + ... + 396670.
It is an arithmetic number, because the mean of its divisors is an integer number (1064267820).
Almost surely, 220131022032 is an apocalyptic number.
20131022032 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
20131022032 is an abundant number, since it is smaller than the sum of its proper divisors (22439690768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20131022032 is a wasteful number, since it uses less digits than its factorization.
20131022032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56611 (or 56605 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 20131022032 its reverse (23022013102), we get a palindrome (43153035134).
The spelling of 20131022032 in words is "twenty billion, one hundred thirty-one million, twenty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •