Base | Representation |
---|---|
bin | 100110011000… |
… | …1101100110000 |
3 | 1101212112101101 |
4 | 1030301230300 |
5 | 20123022022 |
6 | 1555214144 |
7 | 333033610 |
oct | 114615460 |
9 | 41775341 |
10 | 20126512 |
11 | 103a738a |
12 | 68a7354 |
13 | 4228ba3 |
14 | 295ca40 |
15 | 1b78627 |
hex | 1331b30 |
20126512 has 40 divisors (see below), whose sum is σ = 45211392. Its totient is φ = 8500800.
The previous prime is 20126507. The next prime is 20126527. The reversal of 20126512 is 21562102.
It is a super-2 number, since 2×201265122 = 810152970572288, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20126512.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6687 + ... + 9217.
Almost surely, 220126512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20126512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22605696).
20126512 is an abundant number, since it is smaller than the sum of its proper divisors (25084880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20126512 is a wasteful number, since it uses less digits than its factorization.
20126512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2617 (or 2611 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 20126512 is about 4486.2581289979. The cubic root of 20126512 is about 272.0129030788.
Adding to 20126512 its reverse (21562102), we get a palindrome (41688614).
The spelling of 20126512 in words is "twenty million, one hundred twenty-six thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •